Divisors of 47488: All 32 Factors

Quick Answer

47488 has 32 divisors (factors): 1, 2, 4, 7, 8, 14, 16, 28, 32, 53, 56, 64, 106, 112, 128, 212, 224, 371, 424, 448, 742, 848, 896, 1484, 1696, 2968, 3392, 5936, 6784, 11872, 23744, 47488.

Sum: 110160.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 4, 7, 8, 14, 16, 28, 32, 53, 56, 64, 106, 112, 128, 212, 224, 371, 424, 448, 742, 848, 896, 1484, 1696, 2968, 3392, 5936, 6784, 11872, 23744, 47488

Use the calculator above to find all divisors (also called factors) of any positive integer up to 4,782,969. Beyond the divisor list, this tool also shows divisor pairs, the sum and count of divisors, prime factorization, and number properties (prime, perfect square, perfect number).

All Divisors of 47488

The number 47488 has 32 divisors:

1,  2,  4,  7,  8,  14,  16,  28,  32,  53,  56,  64,  106,  112,  128,  212,  224,  371,  424,  448,  742,  848,  896,  1484,  1696,  2968,  3392,  5936,  6784,  11872,  23744,  47488

Divisor Pairs of 47488

Each pair multiplies to 47488:

Factor 1×Factor 2=Product
1×47488=47488
2×23744=47488
4×11872=47488
7×6784=47488
8×5936=47488
14×3392=47488
16×2968=47488
28×1696=47488
32×1484=47488
53×896=47488
56×848=47488
64×742=47488
106×448=47488
112×424=47488
128×371=47488
212×224=47488

Number of Divisors

The number 47488 has 32 divisors, written as τ(47488) = 32 in number theory.

Sum of Divisors

σ(47488) = 1 + 2 + 4 + 7 + 8 + 14 + 16 + 28 + 32 + 53 + 56 + 64 + 106 + 112 + 128 + 212 + 224 + 371 + 424 + 448 + 742 + 848 + 896 + 1484 + 1696 + 2968 + 3392 + 5936 + 6784 + 11872 + 23744 + 47488 = 110160

Properties of 47488

  • 47488 is composite.
  • 47488 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 110160.

Common Divisors with Another Number?

Looking for the divisors that 47488 shares with another number? Use our Greatest Common Factor (GCF) calculator — it finds all common divisors and the largest one.

Step-by-Step: How to Find the Divisors of 47488

An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √47488 ≈ 217.92. If i divides 47488, then both i and 47488/i are divisors.

  1. 1 divides 47488 (47488 ÷ 1 = 47488) → pair (1, 47488)
  2. 2 divides 47488 (47488 ÷ 2 = 23744) → pair (2, 23744)
  3. 4 divides 47488 (47488 ÷ 4 = 11872) → pair (4, 11872)
  4. 7 divides 47488 (47488 ÷ 7 = 6784) → pair (7, 6784)
  5. 8 divides 47488 (47488 ÷ 8 = 5936) → pair (8, 5936)
  6. 14 divides 47488 (47488 ÷ 14 = 3392) → pair (14, 3392)
  7. 16 divides 47488 (47488 ÷ 16 = 2968) → pair (16, 2968)
  8. 28 divides 47488 (47488 ÷ 28 = 1696) → pair (28, 1696)
  9. 32 divides 47488 (47488 ÷ 32 = 1484) → pair (32, 1484)
  10. 53 divides 47488 (47488 ÷ 53 = 896) → pair (53, 896)
  11. 56 divides 47488 (47488 ÷ 56 = 848) → pair (56, 848)
  12. 64 divides 47488 (47488 ÷ 64 = 742) → pair (64, 742)
  13. 106 divides 47488 (47488 ÷ 106 = 448) → pair (106, 448)
  14. 112 divides 47488 (47488 ÷ 112 = 424) → pair (112, 424)
  15. 128 divides 47488 (47488 ÷ 128 = 371) → pair (128, 371)
  16. 212 divides 47488 (47488 ÷ 212 = 224) → pair (212, 224)
  17. Collect all unique values: {1, 2, 4, 7, 8, 14, 16, 28, 32, 53, 56, 64, 106, 112, 128, 212, 224, 371, 424, 448, 742, 848, 896, 1484, 1696, 2968, 3392, 5936, 6784, 11872, 23744, 47488} — total 32 divisors.
  18. Sum: 1 + 2 + 4 + 7 + 8 + 14 + 16 + 28 + 32 + 53 + 56 + 64 + 106 + 112 + 128 + 212 + 224 + 371 + 424 + 448 + 742 + 848 + 896 + 1484 + 1696 + 2968 + 3392 + 5936 + 6784 + 11872 + 23744 + 47488 = 110160.

Nearby Examples

ndivisors countsum σ(n)
360241170
24020744
18018546
14415403
12016360
1009217
9012234
8412224

Related Operations for 47488

What Is a Divisor?

A divisor (also called a factor) of a positive integer n is any positive integer d such that n ÷ d has no remainder. In other words, d divides n evenly.

Every positive integer n has at least two divisors: 1 and n itself (with 1 being the trivial case of having only itself). Numbers with exactly 2 divisors are prime; numbers with 3 or more divisors are composite.

Why use this calculator? Beyond just listing divisors, this tool computes the sum σ(n), the count τ(n), prime factorization, divisor pairs (useful for visual learners and factoring problems), and detects whether n is a prime, a perfect square, or a perfect number.

Divisors Calculation Examples

Find all divisors of these numbers:

Related Calculators