Divisors of 57036: All 36 Factors

Quick Answer

57036 has 36 divisors (factors): 1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 49, 84, 97, 98, 147, 194, 196, 291, 294, 388, 582, 588, 679, 1164, 1358, 2037, 2716, 4074, 4753, 8148, 9506, 14259, 19012, 28518, 57036.

Sum: 156408.

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, 97, 98, 147, 194, 196, 291, 294, 388, 582, 588, 679, 1164, 1358, 2037, 2716, 4074, 4753, 8148, 9506, 14259, 19012, 28518, 57036

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 57036

The number 57036 has 36 divisors:

1,  2,  3,  4,  6,  7,  12,  14,  21,  28,  42,  49,  84,  97,  98,  147,  194,  196,  291,  294,  388,  582,  588,  679,  1164,  1358,  2037,  2716,  4074,  4753,  8148,  9506,  14259,  19012,  28518,  57036

Divisor Pairs of 57036

Each pair multiplies to 57036:

Factor 1×Factor 2=Product
1×57036=57036
2×28518=57036
3×19012=57036
4×14259=57036
6×9506=57036
7×8148=57036
12×4753=57036
14×4074=57036
21×2716=57036
28×2037=57036
42×1358=57036
49×1164=57036
84×679=57036
97×588=57036
98×582=57036
147×388=57036
194×294=57036
196×291=57036

Number of Divisors

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

Sum of Divisors

σ(57036) = 1 + 2 + 3 + 4 + 6 + 7 + 12 + 14 + 21 + 28 + 42 + 49 + 84 + 97 + 98 + 147 + 194 + 196 + 291 + 294 + 388 + 582 + 588 + 679 + 1164 + 1358 + 2037 + 2716 + 4074 + 4753 + 8148 + 9506 + 14259 + 19012 + 28518 + 57036 = 156408

Properties of 57036

  • 57036 is composite.
  • 57036 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 156408.

Common Divisors with Another Number?

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

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

  1. 1 divides 57036 (57036 ÷ 1 = 57036) → pair (1, 57036)
  2. 2 divides 57036 (57036 ÷ 2 = 28518) → pair (2, 28518)
  3. 3 divides 57036 (57036 ÷ 3 = 19012) → pair (3, 19012)
  4. 4 divides 57036 (57036 ÷ 4 = 14259) → pair (4, 14259)
  5. 6 divides 57036 (57036 ÷ 6 = 9506) → pair (6, 9506)
  6. 7 divides 57036 (57036 ÷ 7 = 8148) → pair (7, 8148)
  7. 12 divides 57036 (57036 ÷ 12 = 4753) → pair (12, 4753)
  8. 14 divides 57036 (57036 ÷ 14 = 4074) → pair (14, 4074)
  9. 21 divides 57036 (57036 ÷ 21 = 2716) → pair (21, 2716)
  10. 28 divides 57036 (57036 ÷ 28 = 2037) → pair (28, 2037)
  11. 42 divides 57036 (57036 ÷ 42 = 1358) → pair (42, 1358)
  12. 49 divides 57036 (57036 ÷ 49 = 1164) → pair (49, 1164)
  13. 84 divides 57036 (57036 ÷ 84 = 679) → pair (84, 679)
  14. 97 divides 57036 (57036 ÷ 97 = 588) → pair (97, 588)
  15. 98 divides 57036 (57036 ÷ 98 = 582) → pair (98, 582)
  16. 147 divides 57036 (57036 ÷ 147 = 388) → pair (147, 388)
  17. 194 divides 57036 (57036 ÷ 194 = 294) → pair (194, 294)
  18. 196 divides 57036 (57036 ÷ 196 = 291) → pair (196, 291)
  19. Collect all unique values: {1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 49, 84, 97, 98, 147, 194, 196, 291, 294, 388, 582, 588, 679, 1164, 1358, 2037, 2716, 4074, 4753, 8148, 9506, 14259, 19012, 28518, 57036} — total 36 divisors.
  20. Sum: 1 + 2 + 3 + 4 + 6 + 7 + 12 + 14 + 21 + 28 + 42 + 49 + 84 + 97 + 98 + 147 + 194 + 196 + 291 + 294 + 388 + 582 + 588 + 679 + 1164 + 1358 + 2037 + 2716 + 4074 + 4753 + 8148 + 9506 + 14259 + 19012 + 28518 + 57036 = 156408.

Nearby Examples

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

Related Operations for 57036

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