Divisors of 51552: All 36 Factors

Quick Answer

51552 has 36 divisors (factors): 1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 32, 36, 48, 72, 96, 144, 179, 288, 358, 537, 716, 1074, 1432, 1611, 2148, 2864, 3222, 4296, 5728, 6444, 8592, 12888, 17184, 25776, 51552.

Sum: 147420.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 32, 36, 48, 72, 96, 144, 179, 288, 358, 537, 716, 1074, 1432, 1611, 2148, 2864, 3222, 4296, 5728, 6444, 8592, 12888, 17184, 25776, 51552

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 51552

The number 51552 has 36 divisors:

1,  2,  3,  4,  6,  8,  9,  12,  16,  18,  24,  32,  36,  48,  72,  96,  144,  179,  288,  358,  537,  716,  1074,  1432,  1611,  2148,  2864,  3222,  4296,  5728,  6444,  8592,  12888,  17184,  25776,  51552

Divisor Pairs of 51552

Each pair multiplies to 51552:

Factor 1×Factor 2=Product
1×51552=51552
2×25776=51552
3×17184=51552
4×12888=51552
6×8592=51552
8×6444=51552
9×5728=51552
12×4296=51552
16×3222=51552
18×2864=51552
24×2148=51552
32×1611=51552
36×1432=51552
48×1074=51552
72×716=51552
96×537=51552
144×358=51552
179×288=51552

Number of Divisors

The number 51552 has 36 divisors, written as τ(51552) = 36 in number theory.

Sum of Divisors

σ(51552) = 1 + 2 + 3 + 4 + 6 + 8 + 9 + 12 + 16 + 18 + 24 + 32 + 36 + 48 + 72 + 96 + 144 + 179 + 288 + 358 + 537 + 716 + 1074 + 1432 + 1611 + 2148 + 2864 + 3222 + 4296 + 5728 + 6444 + 8592 + 12888 + 17184 + 25776 + 51552 = 147420

Properties of 51552

  • 51552 is composite.
  • 51552 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 147420.

Common Divisors with Another Number?

Looking for the divisors that 51552 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 51552

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

  1. 1 divides 51552 (51552 ÷ 1 = 51552) → pair (1, 51552)
  2. 2 divides 51552 (51552 ÷ 2 = 25776) → pair (2, 25776)
  3. 3 divides 51552 (51552 ÷ 3 = 17184) → pair (3, 17184)
  4. 4 divides 51552 (51552 ÷ 4 = 12888) → pair (4, 12888)
  5. 6 divides 51552 (51552 ÷ 6 = 8592) → pair (6, 8592)
  6. 8 divides 51552 (51552 ÷ 8 = 6444) → pair (8, 6444)
  7. 9 divides 51552 (51552 ÷ 9 = 5728) → pair (9, 5728)
  8. 12 divides 51552 (51552 ÷ 12 = 4296) → pair (12, 4296)
  9. 16 divides 51552 (51552 ÷ 16 = 3222) → pair (16, 3222)
  10. 18 divides 51552 (51552 ÷ 18 = 2864) → pair (18, 2864)
  11. 24 divides 51552 (51552 ÷ 24 = 2148) → pair (24, 2148)
  12. 32 divides 51552 (51552 ÷ 32 = 1611) → pair (32, 1611)
  13. 36 divides 51552 (51552 ÷ 36 = 1432) → pair (36, 1432)
  14. 48 divides 51552 (51552 ÷ 48 = 1074) → pair (48, 1074)
  15. 72 divides 51552 (51552 ÷ 72 = 716) → pair (72, 716)
  16. 96 divides 51552 (51552 ÷ 96 = 537) → pair (96, 537)
  17. 144 divides 51552 (51552 ÷ 144 = 358) → pair (144, 358)
  18. 179 divides 51552 (51552 ÷ 179 = 288) → pair (179, 288)
  19. Collect all unique values: {1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 32, 36, 48, 72, 96, 144, 179, 288, 358, 537, 716, 1074, 1432, 1611, 2148, 2864, 3222, 4296, 5728, 6444, 8592, 12888, 17184, 25776, 51552} — total 36 divisors.
  20. Sum: 1 + 2 + 3 + 4 + 6 + 8 + 9 + 12 + 16 + 18 + 24 + 32 + 36 + 48 + 72 + 96 + 144 + 179 + 288 + 358 + 537 + 716 + 1074 + 1432 + 1611 + 2148 + 2864 + 3222 + 4296 + 5728 + 6444 + 8592 + 12888 + 17184 + 25776 + 51552 = 147420.

Nearby Examples

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

Related Operations for 51552

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