Divisors of 59130: All 40 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 59130

The number 59130 has 40 divisors:

1,  2,  3,  5,  6,  9,  10,  15,  18,  27,  30,  45,  54,  73,  81,  90,  135,  146,  162,  219,  270,  365,  405,  438,  657,  730,  810,  1095,  1314,  1971,  2190,  3285,  3942,  5913,  6570,  9855,  11826,  19710,  29565,  59130

Divisor Pairs of 59130

Each pair multiplies to 59130:

Number of Divisors

The number 59130 has 40 divisors, written as τ(59130) = 40 in number theory.

Sum of Divisors

σ(59130) = 1 + 2 + 3 + 5 + 6 + 9 + 10 + 15 + 18 + 27 + 30 + 45 + 54 + 73 + 81 + 90 + 135 + 146 + 162 + 219 + 270 + 365 + 405 + 438 + 657 + 730 + 810 + 1095 + 1314 + 1971 + 2190 + 3285 + 3942 + 5913 + 6570 + 9855 + 11826 + 19710 + 29565 + 59130 = 161172

Prime Factorization of 59130

See the full prime factorization calculator →

Properties of 59130

• 59130 is composite.
• 59130 is not a perfect square.
• Number of divisors: 40.
• Sum of divisors: 161172.

Common Divisors with Another Number?

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

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

1. 1 divides 59130 (59130 ÷ 1 = 59130) → pair (1, 59130)
2. 2 divides 59130 (59130 ÷ 2 = 29565) → pair (2, 29565)
3. 3 divides 59130 (59130 ÷ 3 = 19710) → pair (3, 19710)
4. 5 divides 59130 (59130 ÷ 5 = 11826) → pair (5, 11826)
5. 6 divides 59130 (59130 ÷ 6 = 9855) → pair (6, 9855)
6. 9 divides 59130 (59130 ÷ 9 = 6570) → pair (9, 6570)
7. 10 divides 59130 (59130 ÷ 10 = 5913) → pair (10, 5913)
8. 15 divides 59130 (59130 ÷ 15 = 3942) → pair (15, 3942)
9. 18 divides 59130 (59130 ÷ 18 = 3285) → pair (18, 3285)
10. 27 divides 59130 (59130 ÷ 27 = 2190) → pair (27, 2190)
11. 30 divides 59130 (59130 ÷ 30 = 1971) → pair (30, 1971)
12. 45 divides 59130 (59130 ÷ 45 = 1314) → pair (45, 1314)
13. 54 divides 59130 (59130 ÷ 54 = 1095) → pair (54, 1095)
14. 73 divides 59130 (59130 ÷ 73 = 810) → pair (73, 810)
15. 81 divides 59130 (59130 ÷ 81 = 730) → pair (81, 730)
16. 90 divides 59130 (59130 ÷ 90 = 657) → pair (90, 657)
17. 135 divides 59130 (59130 ÷ 135 = 438) → pair (135, 438)
18. 146 divides 59130 (59130 ÷ 146 = 405) → pair (146, 405)
19. 162 divides 59130 (59130 ÷ 162 = 365) → pair (162, 365)
20. 219 divides 59130 (59130 ÷ 219 = 270) → pair (219, 270)
21. Collect all unique values: {1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 73, 81, 90, 135, 146, 162, 219, 270, 365, 405, 438, 657, 730, 810, 1095, 1314, 1971, 2190, 3285, 3942, 5913, 6570, 9855, 11826, 19710, 29565, 59130} — total 40 divisors.
22. Sum: 1 + 2 + 3 + 5 + 6 + 9 + 10 + 15 + 18 + 27 + 30 + 45 + 54 + 73 + 81 + 90 + 135 + 146 + 162 + 219 + 270 + 365 + 405 + 438 + 657 + 730 + 810 + 1095 + 1314 + 1971 + 2190 + 3285 + 3942 + 5913 + 6570 + 9855 + 11826 + 19710 + 29565 + 59130 = 161172.

Nearby Examples

Related Operations for 59130

• Multiples of a Number — "outward" complement of divisors
• 59130 Prime Factorization — decompose into prime building blocks
• Find GCF of 59130 and another number
• Find LCM of 59130 and another number
• Is 59130 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: