Divisors of 55650: All 48 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 55650

The number 55650 has 48 divisors:

1,  2,  3,  5,  6,  7,  10,  14,  15,  21,  25,  30,  35,  42,  50,  53,  70,  75,  105,  106,  150,  159,  175,  210,  265,  318,  350,  371,  525,  530,  742,  795,  1050,  1113,  1325,  1590,  1855,  2226,  2650,  3710,  3975,  5565,  7950,  9275,  11130,  18550,  27825,  55650

Divisor Pairs of 55650

Each pair multiplies to 55650:

Number of Divisors

The number 55650 has 48 divisors, written as τ(55650) = 48 in number theory.

Sum of Divisors

σ(55650) = 1 + 2 + 3 + 5 + 6 + 7 + 10 + 14 + 15 + 21 + 25 + 30 + 35 + 42 + 50 + 53 + 70 + 75 + 105 + 106 + 150 + 159 + 175 + 210 + 265 + 318 + 350 + 371 + 525 + 530 + 742 + 795 + 1050 + 1113 + 1325 + 1590 + 1855 + 2226 + 2650 + 3710 + 3975 + 5565 + 7950 + 9275 + 11130 + 18550 + 27825 + 55650 = 160704

Prime Factorization of 55650

See the full prime factorization calculator →

Properties of 55650

• 55650 is composite.
• 55650 is not a perfect square.
• Number of divisors: 48.
• Sum of divisors: 160704.

Common Divisors with Another Number?

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

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

1. 1 divides 55650 (55650 ÷ 1 = 55650) → pair (1, 55650)
2. 2 divides 55650 (55650 ÷ 2 = 27825) → pair (2, 27825)
3. 3 divides 55650 (55650 ÷ 3 = 18550) → pair (3, 18550)
4. 5 divides 55650 (55650 ÷ 5 = 11130) → pair (5, 11130)
5. 6 divides 55650 (55650 ÷ 6 = 9275) → pair (6, 9275)
6. 7 divides 55650 (55650 ÷ 7 = 7950) → pair (7, 7950)
7. 10 divides 55650 (55650 ÷ 10 = 5565) → pair (10, 5565)
8. 14 divides 55650 (55650 ÷ 14 = 3975) → pair (14, 3975)
9. 15 divides 55650 (55650 ÷ 15 = 3710) → pair (15, 3710)
10. 21 divides 55650 (55650 ÷ 21 = 2650) → pair (21, 2650)
11. 25 divides 55650 (55650 ÷ 25 = 2226) → pair (25, 2226)
12. 30 divides 55650 (55650 ÷ 30 = 1855) → pair (30, 1855)
13. 35 divides 55650 (55650 ÷ 35 = 1590) → pair (35, 1590)
14. 42 divides 55650 (55650 ÷ 42 = 1325) → pair (42, 1325)
15. 50 divides 55650 (55650 ÷ 50 = 1113) → pair (50, 1113)
16. 53 divides 55650 (55650 ÷ 53 = 1050) → pair (53, 1050)
17. 70 divides 55650 (55650 ÷ 70 = 795) → pair (70, 795)
18. 75 divides 55650 (55650 ÷ 75 = 742) → pair (75, 742)
19. 105 divides 55650 (55650 ÷ 105 = 530) → pair (105, 530)
20. 106 divides 55650 (55650 ÷ 106 = 525) → pair (106, 525)
21. 150 divides 55650 (55650 ÷ 150 = 371) → pair (150, 371)
22. 159 divides 55650 (55650 ÷ 159 = 350) → pair (159, 350)
23. 175 divides 55650 (55650 ÷ 175 = 318) → pair (175, 318)
24. 210 divides 55650 (55650 ÷ 210 = 265) → pair (210, 265)
25. Collect all unique values: {1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 25, 30, 35, 42, 50, 53, 70, 75, 105, 106, 150, 159, 175, 210, 265, 318, 350, 371, 525, 530, 742, 795, 1050, 1113, 1325, 1590, 1855, 2226, 2650, 3710, 3975, 5565, 7950, 9275, 11130, 18550, 27825, 55650} — total 48 divisors.
26. Sum: 1 + 2 + 3 + 5 + 6 + 7 + 10 + 14 + 15 + 21 + 25 + 30 + 35 + 42 + 50 + 53 + 70 + 75 + 105 + 106 + 150 + 159 + 175 + 210 + 265 + 318 + 350 + 371 + 525 + 530 + 742 + 795 + 1050 + 1113 + 1325 + 1590 + 1855 + 2226 + 2650 + 3710 + 3975 + 5565 + 7950 + 9275 + 11130 + 18550 + 27825 + 55650 = 160704.

Nearby Examples

Related Operations for 55650

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