Divisors of 52332: All 36 Factors

Quick Answer

52332 has 36 divisors (factors): 1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 49, 84, 89, 98, 147, 178, 196, 267, 294, 356, 534, 588, 623, 1068, 1246, 1869, 2492, 3738, 4361, 7476, 8722, 13083, 17444, 26166, 52332.

Sum: 143640.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 49, 84, 89, 98, 147, 178, 196, 267, 294, 356, 534, 588, 623, 1068, 1246, 1869, 2492, 3738, 4361, 7476, 8722, 13083, 17444, 26166, 52332

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 52332

The number 52332 has 36 divisors:

1,  2,  3,  4,  6,  7,  12,  14,  21,  28,  42,  49,  84,  89,  98,  147,  178,  196,  267,  294,  356,  534,  588,  623,  1068,  1246,  1869,  2492,  3738,  4361,  7476,  8722,  13083,  17444,  26166,  52332

Divisor Pairs of 52332

Each pair multiplies to 52332:

Factor 1×Factor 2=Product
1×52332=52332
2×26166=52332
3×17444=52332
4×13083=52332
6×8722=52332
7×7476=52332
12×4361=52332
14×3738=52332
21×2492=52332
28×1869=52332
42×1246=52332
49×1068=52332
84×623=52332
89×588=52332
98×534=52332
147×356=52332
178×294=52332
196×267=52332

Number of Divisors

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

Sum of Divisors

σ(52332) = 1 + 2 + 3 + 4 + 6 + 7 + 12 + 14 + 21 + 28 + 42 + 49 + 84 + 89 + 98 + 147 + 178 + 196 + 267 + 294 + 356 + 534 + 588 + 623 + 1068 + 1246 + 1869 + 2492 + 3738 + 4361 + 7476 + 8722 + 13083 + 17444 + 26166 + 52332 = 143640

Properties of 52332

  • 52332 is composite.
  • 52332 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 143640.

Common Divisors with Another Number?

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

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

  1. 1 divides 52332 (52332 ÷ 1 = 52332) → pair (1, 52332)
  2. 2 divides 52332 (52332 ÷ 2 = 26166) → pair (2, 26166)
  3. 3 divides 52332 (52332 ÷ 3 = 17444) → pair (3, 17444)
  4. 4 divides 52332 (52332 ÷ 4 = 13083) → pair (4, 13083)
  5. 6 divides 52332 (52332 ÷ 6 = 8722) → pair (6, 8722)
  6. 7 divides 52332 (52332 ÷ 7 = 7476) → pair (7, 7476)
  7. 12 divides 52332 (52332 ÷ 12 = 4361) → pair (12, 4361)
  8. 14 divides 52332 (52332 ÷ 14 = 3738) → pair (14, 3738)
  9. 21 divides 52332 (52332 ÷ 21 = 2492) → pair (21, 2492)
  10. 28 divides 52332 (52332 ÷ 28 = 1869) → pair (28, 1869)
  11. 42 divides 52332 (52332 ÷ 42 = 1246) → pair (42, 1246)
  12. 49 divides 52332 (52332 ÷ 49 = 1068) → pair (49, 1068)
  13. 84 divides 52332 (52332 ÷ 84 = 623) → pair (84, 623)
  14. 89 divides 52332 (52332 ÷ 89 = 588) → pair (89, 588)
  15. 98 divides 52332 (52332 ÷ 98 = 534) → pair (98, 534)
  16. 147 divides 52332 (52332 ÷ 147 = 356) → pair (147, 356)
  17. 178 divides 52332 (52332 ÷ 178 = 294) → pair (178, 294)
  18. 196 divides 52332 (52332 ÷ 196 = 267) → pair (196, 267)
  19. Collect all unique values: {1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 49, 84, 89, 98, 147, 178, 196, 267, 294, 356, 534, 588, 623, 1068, 1246, 1869, 2492, 3738, 4361, 7476, 8722, 13083, 17444, 26166, 52332} — total 36 divisors.
  20. Sum: 1 + 2 + 3 + 4 + 6 + 7 + 12 + 14 + 21 + 28 + 42 + 49 + 84 + 89 + 98 + 147 + 178 + 196 + 267 + 294 + 356 + 534 + 588 + 623 + 1068 + 1246 + 1869 + 2492 + 3738 + 4361 + 7476 + 8722 + 13083 + 17444 + 26166 + 52332 = 143640.

Nearby Examples

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

Related Operations for 52332

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