Divisors of 55080: All 80 Factors
Quick Answer
55080 has 80 divisors (factors): 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 17, 18, 20, 24, 27, 30, 34, 36, 40, 45, 51, 54, 60, 68, 72, 81, 85, 90, 102, 108, 120, 135, 136, 153, 162, 170, 180, 204, 216, 255, 270, 306, 324, 340, 360, 405, 408, 459, 510, 540, 612, 648, 680, 765, 810, 918, 1020, 1080, 1224, 1377, 1530, 1620, 1836, 2040, 2295, 2754, 3060, 3240, 3672, 4590, 5508, 6120, 6885, 9180, 11016, 13770, 18360, 27540, 55080.
Sum: 196020.
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 55080
The number 55080 has 80 divisors:
1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 17, 18, 20, 24, 27, 30, 34, 36, 40, 45, 51, 54, 60, 68, 72, 81, 85, 90, 102, 108, 120, 135, 136, 153, 162, 170, 180, 204, 216, 255, 270, 306, 324, 340, 360, 405, 408, 459, 510, 540, 612, 648, 680, 765, 810, 918, 1020, 1080, 1224, 1377, 1530, 1620, 1836, 2040, 2295, 2754, 3060, 3240, 3672, 4590, 5508, 6120, 6885, 9180, 11016, 13770, 18360, 27540, 55080
Divisor Pairs of 55080
Each pair multiplies to 55080:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 55080 | = | 55080 |
| 2 | × | 27540 | = | 55080 |
| 3 | × | 18360 | = | 55080 |
| 4 | × | 13770 | = | 55080 |
| 5 | × | 11016 | = | 55080 |
| 6 | × | 9180 | = | 55080 |
| 8 | × | 6885 | = | 55080 |
| 9 | × | 6120 | = | 55080 |
| 10 | × | 5508 | = | 55080 |
| 12 | × | 4590 | = | 55080 |
| 15 | × | 3672 | = | 55080 |
| 17 | × | 3240 | = | 55080 |
| 18 | × | 3060 | = | 55080 |
| 20 | × | 2754 | = | 55080 |
| 24 | × | 2295 | = | 55080 |
| 27 | × | 2040 | = | 55080 |
| 30 | × | 1836 | = | 55080 |
| 34 | × | 1620 | = | 55080 |
| 36 | × | 1530 | = | 55080 |
| 40 | × | 1377 | = | 55080 |
| 45 | × | 1224 | = | 55080 |
| 51 | × | 1080 | = | 55080 |
| 54 | × | 1020 | = | 55080 |
| 60 | × | 918 | = | 55080 |
| 68 | × | 810 | = | 55080 |
| 72 | × | 765 | = | 55080 |
| 81 | × | 680 | = | 55080 |
| 85 | × | 648 | = | 55080 |
| 90 | × | 612 | = | 55080 |
| 102 | × | 540 | = | 55080 |
| 108 | × | 510 | = | 55080 |
| 120 | × | 459 | = | 55080 |
| 135 | × | 408 | = | 55080 |
| 136 | × | 405 | = | 55080 |
| 153 | × | 360 | = | 55080 |
| 162 | × | 340 | = | 55080 |
| 170 | × | 324 | = | 55080 |
| 180 | × | 306 | = | 55080 |
| 204 | × | 270 | = | 55080 |
| 216 | × | 255 | = | 55080 |
Number of Divisors
The number 55080 has 80 divisors, written as τ(55080) = 80 in number theory.
Sum of Divisors
σ(55080) = 1 + 2 + 3 + 4 + 5 + 6 + 8 + 9 + 10 + 12 + 15 + 17 + 18 + 20 + 24 + 27 + 30 + 34 + 36 + 40 + 45 + 51 + 54 + 60 + 68 + 72 + 81 + 85 + 90 + 102 + 108 + 120 + 135 + 136 + 153 + 162 + 170 + 180 + 204 + 216 + 255 + 270 + 306 + 324 + 340 + 360 + 405 + 408 + 459 + 510 + 540 + 612 + 648 + 680 + 765 + 810 + 918 + 1020 + 1080 + 1224 + 1377 + 1530 + 1620 + 1836 + 2040 + 2295 + 2754 + 3060 + 3240 + 3672 + 4590 + 5508 + 6120 + 6885 + 9180 + 11016 + 13770 + 18360 + 27540 + 55080 = 196020
Prime Factorization of 55080
Properties of 55080
- 55080 is composite.
- 55080 is not a perfect square.
- Number of divisors: 80.
- Sum of divisors: 196020.
Common Divisors with Another Number?
Looking for the divisors that 55080 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 55080
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √55080 ≈ 234.69. If i divides 55080, then both i and 55080/i are divisors.
- 1 divides 55080 (55080 ÷ 1 = 55080) → pair (1, 55080)
- 2 divides 55080 (55080 ÷ 2 = 27540) → pair (2, 27540)
- 3 divides 55080 (55080 ÷ 3 = 18360) → pair (3, 18360)
- 4 divides 55080 (55080 ÷ 4 = 13770) → pair (4, 13770)
- 5 divides 55080 (55080 ÷ 5 = 11016) → pair (5, 11016)
- 6 divides 55080 (55080 ÷ 6 = 9180) → pair (6, 9180)
- 8 divides 55080 (55080 ÷ 8 = 6885) → pair (8, 6885)
- 9 divides 55080 (55080 ÷ 9 = 6120) → pair (9, 6120)
- 10 divides 55080 (55080 ÷ 10 = 5508) → pair (10, 5508)
- 12 divides 55080 (55080 ÷ 12 = 4590) → pair (12, 4590)
- 15 divides 55080 (55080 ÷ 15 = 3672) → pair (15, 3672)
- 17 divides 55080 (55080 ÷ 17 = 3240) → pair (17, 3240)
- 18 divides 55080 (55080 ÷ 18 = 3060) → pair (18, 3060)
- 20 divides 55080 (55080 ÷ 20 = 2754) → pair (20, 2754)
- 24 divides 55080 (55080 ÷ 24 = 2295) → pair (24, 2295)
- 27 divides 55080 (55080 ÷ 27 = 2040) → pair (27, 2040)
- 30 divides 55080 (55080 ÷ 30 = 1836) → pair (30, 1836)
- 34 divides 55080 (55080 ÷ 34 = 1620) → pair (34, 1620)
- 36 divides 55080 (55080 ÷ 36 = 1530) → pair (36, 1530)
- 40 divides 55080 (55080 ÷ 40 = 1377) → pair (40, 1377)
- 45 divides 55080 (55080 ÷ 45 = 1224) → pair (45, 1224)
- 51 divides 55080 (55080 ÷ 51 = 1080) → pair (51, 1080)
- 54 divides 55080 (55080 ÷ 54 = 1020) → pair (54, 1020)
- 60 divides 55080 (55080 ÷ 60 = 918) → pair (60, 918)
- 68 divides 55080 (55080 ÷ 68 = 810) → pair (68, 810)
- 72 divides 55080 (55080 ÷ 72 = 765) → pair (72, 765)
- 81 divides 55080 (55080 ÷ 81 = 680) → pair (81, 680)
- 85 divides 55080 (55080 ÷ 85 = 648) → pair (85, 648)
- 90 divides 55080 (55080 ÷ 90 = 612) → pair (90, 612)
- 102 divides 55080 (55080 ÷ 102 = 540) → pair (102, 540)
- 108 divides 55080 (55080 ÷ 108 = 510) → pair (108, 510)
- 120 divides 55080 (55080 ÷ 120 = 459) → pair (120, 459)
- 135 divides 55080 (55080 ÷ 135 = 408) → pair (135, 408)
- 136 divides 55080 (55080 ÷ 136 = 405) → pair (136, 405)
- 153 divides 55080 (55080 ÷ 153 = 360) → pair (153, 360)
- 162 divides 55080 (55080 ÷ 162 = 340) → pair (162, 340)
- 170 divides 55080 (55080 ÷ 170 = 324) → pair (170, 324)
- 180 divides 55080 (55080 ÷ 180 = 306) → pair (180, 306)
- 204 divides 55080 (55080 ÷ 204 = 270) → pair (204, 270)
- 216 divides 55080 (55080 ÷ 216 = 255) → pair (216, 255)
- Collect all unique values: {1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 17, 18, 20, 24, 27, 30, 34, 36, 40, 45, 51, 54, 60, 68, 72, 81, 85, 90, 102, 108, 120, 135, 136, 153, 162, 170, 180, 204, 216, 255, 270, 306, 324, 340, 360, 405, 408, 459, 510, 540, 612, 648, 680, 765, 810, 918, 1020, 1080, 1224, 1377, 1530, 1620, 1836, 2040, 2295, 2754, 3060, 3240, 3672, 4590, 5508, 6120, 6885, 9180, 11016, 13770, 18360, 27540, 55080} — total 80 divisors.
- Sum: 1 + 2 + 3 + 4 + 5 + 6 + 8 + 9 + 10 + 12 + 15 + 17 + 18 + 20 + 24 + 27 + 30 + 34 + 36 + 40 + 45 + 51 + 54 + 60 + 68 + 72 + 81 + 85 + 90 + 102 + 108 + 120 + 135 + 136 + 153 + 162 + 170 + 180 + 204 + 216 + 255 + 270 + 306 + 324 + 340 + 360 + 405 + 408 + 459 + 510 + 540 + 612 + 648 + 680 + 765 + 810 + 918 + 1020 + 1080 + 1224 + 1377 + 1530 + 1620 + 1836 + 2040 + 2295 + 2754 + 3060 + 3240 + 3672 + 4590 + 5508 + 6120 + 6885 + 9180 + 11016 + 13770 + 18360 + 27540 + 55080 = 196020.
Nearby Examples
Related Operations for 55080
- Multiples of a Number — "outward" complement of divisors
- 55080 Prime Factorization — decompose into prime building blocks
- Find GCF of 55080 and another number
- Find LCM of 55080 and another number
- Is 55080 a perfect square? (odd divisor count ⇔ yes)
See also our tables of divisors:
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
- Multiples of a Number — "outward" complement
- Prime Factorization — product of prime divisors
- Greatest Common Factor (GCF) — largest common divisor of 2+ numbers
- Least Common Multiple (LCM) — smallest common multiple
- Is N a Perfect Square? — odd divisor count check