Divisors of 53130: All 64 Factors

Divisors (Factors) Calculator

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 53130

The number 53130 has 64 divisors:

1,  2,  3,  5,  6,  7,  10,  11,  14,  15,  21,  22,  23,  30,  33,  35,  42,  46,  55,  66,  69,  70,  77,  105,  110,  115,  138,  154,  161,  165,  210,  230,  231,  253,  322,  330,  345,  385,  462,  483,  506,  690,  759,  770,  805,  966,  1155,  1265,  1518,  1610,  1771,  2310,  2415,  2530,  3542,  3795,  4830,  5313,  7590,  8855,  10626,  17710,  26565,  53130

Divisor Pairs of 53130

Each pair multiplies to 53130:

Number of Divisors

The number 53130 has 64 divisors, written as τ(53130) = 64 in number theory.

Sum of Divisors

σ(53130) = 1 + 2 + 3 + 5 + 6 + 7 + 10 + 11 + 14 + 15 + 21 + 22 + 23 + 30 + 33 + 35 + 42 + 46 + 55 + 66 + 69 + 70 + 77 + 105 + 110 + 115 + 138 + 154 + 161 + 165 + 210 + 230 + 231 + 253 + 322 + 330 + 345 + 385 + 462 + 483 + 506 + 690 + 759 + 770 + 805 + 966 + 1155 + 1265 + 1518 + 1610 + 1771 + 2310 + 2415 + 2530 + 3542 + 3795 + 4830 + 5313 + 7590 + 8855 + 10626 + 17710 + 26565 + 53130 = 165888

Prime Factorization of 53130

See the full prime factorization calculator →

Properties of 53130

• 53130 is composite.
• 53130 is not a perfect square.
• Number of divisors: 64.
• Sum of divisors: 165888.

Common Divisors with Another Number?

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

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

1. 1 divides 53130 (53130 ÷ 1 = 53130) → pair (1, 53130)
2. 2 divides 53130 (53130 ÷ 2 = 26565) → pair (2, 26565)
3. 3 divides 53130 (53130 ÷ 3 = 17710) → pair (3, 17710)
4. 5 divides 53130 (53130 ÷ 5 = 10626) → pair (5, 10626)
5. 6 divides 53130 (53130 ÷ 6 = 8855) → pair (6, 8855)
6. 7 divides 53130 (53130 ÷ 7 = 7590) → pair (7, 7590)
7. 10 divides 53130 (53130 ÷ 10 = 5313) → pair (10, 5313)
8. 11 divides 53130 (53130 ÷ 11 = 4830) → pair (11, 4830)
9. 14 divides 53130 (53130 ÷ 14 = 3795) → pair (14, 3795)
10. 15 divides 53130 (53130 ÷ 15 = 3542) → pair (15, 3542)
11. 21 divides 53130 (53130 ÷ 21 = 2530) → pair (21, 2530)
12. 22 divides 53130 (53130 ÷ 22 = 2415) → pair (22, 2415)
13. 23 divides 53130 (53130 ÷ 23 = 2310) → pair (23, 2310)
14. 30 divides 53130 (53130 ÷ 30 = 1771) → pair (30, 1771)
15. 33 divides 53130 (53130 ÷ 33 = 1610) → pair (33, 1610)
16. 35 divides 53130 (53130 ÷ 35 = 1518) → pair (35, 1518)
17. 42 divides 53130 (53130 ÷ 42 = 1265) → pair (42, 1265)
18. 46 divides 53130 (53130 ÷ 46 = 1155) → pair (46, 1155)
19. 55 divides 53130 (53130 ÷ 55 = 966) → pair (55, 966)
20. 66 divides 53130 (53130 ÷ 66 = 805) → pair (66, 805)
21. 69 divides 53130 (53130 ÷ 69 = 770) → pair (69, 770)
22. 70 divides 53130 (53130 ÷ 70 = 759) → pair (70, 759)
23. 77 divides 53130 (53130 ÷ 77 = 690) → pair (77, 690)
24. 105 divides 53130 (53130 ÷ 105 = 506) → pair (105, 506)
25. 110 divides 53130 (53130 ÷ 110 = 483) → pair (110, 483)
26. 115 divides 53130 (53130 ÷ 115 = 462) → pair (115, 462)
27. 138 divides 53130 (53130 ÷ 138 = 385) → pair (138, 385)
28. 154 divides 53130 (53130 ÷ 154 = 345) → pair (154, 345)
29. 161 divides 53130 (53130 ÷ 161 = 330) → pair (161, 330)
30. 165 divides 53130 (53130 ÷ 165 = 322) → pair (165, 322)
31. 210 divides 53130 (53130 ÷ 210 = 253) → pair (210, 253)
32. 230 divides 53130 (53130 ÷ 230 = 231) → pair (230, 231)
33. Collect all unique values: {1, 2, 3, 5, 6, 7, 10, 11, 14, 15, 21, 22, 23, 30, 33, 35, 42, 46, 55, 66, 69, 70, 77, 105, 110, 115, 138, 154, 161, 165, 210, 230, 231, 253, 322, 330, 345, 385, 462, 483, 506, 690, 759, 770, 805, 966, 1155, 1265, 1518, 1610, 1771, 2310, 2415, 2530, 3542, 3795, 4830, 5313, 7590, 8855, 10626, 17710, 26565, 53130} — total 64 divisors.
34. Sum: 1 + 2 + 3 + 5 + 6 + 7 + 10 + 11 + 14 + 15 + 21 + 22 + 23 + 30 + 33 + 35 + 42 + 46 + 55 + 66 + 69 + 70 + 77 + 105 + 110 + 115 + 138 + 154 + 161 + 165 + 210 + 230 + 231 + 253 + 322 + 330 + 345 + 385 + 462 + 483 + 506 + 690 + 759 + 770 + 805 + 966 + 1155 + 1265 + 1518 + 1610 + 1771 + 2310 + 2415 + 2530 + 3542 + 3795 + 4830 + 5313 + 7590 + 8855 + 10626 + 17710 + 26565 + 53130 = 165888.

Nearby Examples

Related Operations for 53130

• Multiples of a Number — "outward" complement of divisors
• 53130 Prime Factorization — decompose into prime building blocks
• Find GCF of 53130 and another number
• Find LCM of 53130 and another number
• Is 53130 a perfect square? (odd divisor count ⇔ yes)

See also our tables of divisors:

• Table of all divisors from 1 to 100
• Table of all divisors from 1 to 500
• Table of all divisors from 1 to 1,000
• Table of all divisors from 1 to 10,000

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.

References

• [1] Divisor (Wikipedia)
• [2] Divisor function (Wikipedia)
• [3] Divisor (Wolfram MathWorld)

Divisors Calculation Examples

Find all divisors of these numbers: