Divisors of 55680: All 64 Factors
Quick Answer
55680 has 64 divisors (factors): 1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 24, 29, 30, 32, 40, 48, 58, 60, 64, 80, 87, 96, 116, 120, 128, 145, 160, 174, 192, 232, 240, 290, 320, 348, 384, 435, 464, 480, 580, 640, 696, 870, 928, 960, 1160, 1392, 1740, 1856, 1920, 2320, 2784, 3480, 3712, 4640, 5568, 6960, 9280, 11136, 13920, 18560, 27840, 55680.
Sum: 183600.
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 55680
The number 55680 has 64 divisors:
1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 24, 29, 30, 32, 40, 48, 58, 60, 64, 80, 87, 96, 116, 120, 128, 145, 160, 174, 192, 232, 240, 290, 320, 348, 384, 435, 464, 480, 580, 640, 696, 870, 928, 960, 1160, 1392, 1740, 1856, 1920, 2320, 2784, 3480, 3712, 4640, 5568, 6960, 9280, 11136, 13920, 18560, 27840, 55680
Divisor Pairs of 55680
Each pair multiplies to 55680:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 55680 | = | 55680 |
| 2 | × | 27840 | = | 55680 |
| 3 | × | 18560 | = | 55680 |
| 4 | × | 13920 | = | 55680 |
| 5 | × | 11136 | = | 55680 |
| 6 | × | 9280 | = | 55680 |
| 8 | × | 6960 | = | 55680 |
| 10 | × | 5568 | = | 55680 |
| 12 | × | 4640 | = | 55680 |
| 15 | × | 3712 | = | 55680 |
| 16 | × | 3480 | = | 55680 |
| 20 | × | 2784 | = | 55680 |
| 24 | × | 2320 | = | 55680 |
| 29 | × | 1920 | = | 55680 |
| 30 | × | 1856 | = | 55680 |
| 32 | × | 1740 | = | 55680 |
| 40 | × | 1392 | = | 55680 |
| 48 | × | 1160 | = | 55680 |
| 58 | × | 960 | = | 55680 |
| 60 | × | 928 | = | 55680 |
| 64 | × | 870 | = | 55680 |
| 80 | × | 696 | = | 55680 |
| 87 | × | 640 | = | 55680 |
| 96 | × | 580 | = | 55680 |
| 116 | × | 480 | = | 55680 |
| 120 | × | 464 | = | 55680 |
| 128 | × | 435 | = | 55680 |
| 145 | × | 384 | = | 55680 |
| 160 | × | 348 | = | 55680 |
| 174 | × | 320 | = | 55680 |
| 192 | × | 290 | = | 55680 |
| 232 | × | 240 | = | 55680 |
Number of Divisors
The number 55680 has 64 divisors, written as τ(55680) = 64 in number theory.
Sum of Divisors
σ(55680) = 1 + 2 + 3 + 4 + 5 + 6 + 8 + 10 + 12 + 15 + 16 + 20 + 24 + 29 + 30 + 32 + 40 + 48 + 58 + 60 + 64 + 80 + 87 + 96 + 116 + 120 + 128 + 145 + 160 + 174 + 192 + 232 + 240 + 290 + 320 + 348 + 384 + 435 + 464 + 480 + 580 + 640 + 696 + 870 + 928 + 960 + 1160 + 1392 + 1740 + 1856 + 1920 + 2320 + 2784 + 3480 + 3712 + 4640 + 5568 + 6960 + 9280 + 11136 + 13920 + 18560 + 27840 + 55680 = 183600
Prime Factorization of 55680
Properties of 55680
- 55680 is composite.
- 55680 is not a perfect square.
- Number of divisors: 64.
- Sum of divisors: 183600.
Common Divisors with Another Number?
Looking for the divisors that 55680 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 55680
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √55680 ≈ 235.97. If i divides 55680, then both i and 55680/i are divisors.
- 1 divides 55680 (55680 ÷ 1 = 55680) → pair (1, 55680)
- 2 divides 55680 (55680 ÷ 2 = 27840) → pair (2, 27840)
- 3 divides 55680 (55680 ÷ 3 = 18560) → pair (3, 18560)
- 4 divides 55680 (55680 ÷ 4 = 13920) → pair (4, 13920)
- 5 divides 55680 (55680 ÷ 5 = 11136) → pair (5, 11136)
- 6 divides 55680 (55680 ÷ 6 = 9280) → pair (6, 9280)
- 8 divides 55680 (55680 ÷ 8 = 6960) → pair (8, 6960)
- 10 divides 55680 (55680 ÷ 10 = 5568) → pair (10, 5568)
- 12 divides 55680 (55680 ÷ 12 = 4640) → pair (12, 4640)
- 15 divides 55680 (55680 ÷ 15 = 3712) → pair (15, 3712)
- 16 divides 55680 (55680 ÷ 16 = 3480) → pair (16, 3480)
- 20 divides 55680 (55680 ÷ 20 = 2784) → pair (20, 2784)
- 24 divides 55680 (55680 ÷ 24 = 2320) → pair (24, 2320)
- 29 divides 55680 (55680 ÷ 29 = 1920) → pair (29, 1920)
- 30 divides 55680 (55680 ÷ 30 = 1856) → pair (30, 1856)
- 32 divides 55680 (55680 ÷ 32 = 1740) → pair (32, 1740)
- 40 divides 55680 (55680 ÷ 40 = 1392) → pair (40, 1392)
- 48 divides 55680 (55680 ÷ 48 = 1160) → pair (48, 1160)
- 58 divides 55680 (55680 ÷ 58 = 960) → pair (58, 960)
- 60 divides 55680 (55680 ÷ 60 = 928) → pair (60, 928)
- 64 divides 55680 (55680 ÷ 64 = 870) → pair (64, 870)
- 80 divides 55680 (55680 ÷ 80 = 696) → pair (80, 696)
- 87 divides 55680 (55680 ÷ 87 = 640) → pair (87, 640)
- 96 divides 55680 (55680 ÷ 96 = 580) → pair (96, 580)
- 116 divides 55680 (55680 ÷ 116 = 480) → pair (116, 480)
- 120 divides 55680 (55680 ÷ 120 = 464) → pair (120, 464)
- 128 divides 55680 (55680 ÷ 128 = 435) → pair (128, 435)
- 145 divides 55680 (55680 ÷ 145 = 384) → pair (145, 384)
- 160 divides 55680 (55680 ÷ 160 = 348) → pair (160, 348)
- 174 divides 55680 (55680 ÷ 174 = 320) → pair (174, 320)
- 192 divides 55680 (55680 ÷ 192 = 290) → pair (192, 290)
- 232 divides 55680 (55680 ÷ 232 = 240) → pair (232, 240)
- Collect all unique values: {1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 24, 29, 30, 32, 40, 48, 58, 60, 64, 80, 87, 96, 116, 120, 128, 145, 160, 174, 192, 232, 240, 290, 320, 348, 384, 435, 464, 480, 580, 640, 696, 870, 928, 960, 1160, 1392, 1740, 1856, 1920, 2320, 2784, 3480, 3712, 4640, 5568, 6960, 9280, 11136, 13920, 18560, 27840, 55680} — total 64 divisors.
- Sum: 1 + 2 + 3 + 4 + 5 + 6 + 8 + 10 + 12 + 15 + 16 + 20 + 24 + 29 + 30 + 32 + 40 + 48 + 58 + 60 + 64 + 80 + 87 + 96 + 116 + 120 + 128 + 145 + 160 + 174 + 192 + 232 + 240 + 290 + 320 + 348 + 384 + 435 + 464 + 480 + 580 + 640 + 696 + 870 + 928 + 960 + 1160 + 1392 + 1740 + 1856 + 1920 + 2320 + 2784 + 3480 + 3712 + 4640 + 5568 + 6960 + 9280 + 11136 + 13920 + 18560 + 27840 + 55680 = 183600.
Nearby Examples
Related Operations for 55680
- Multiples of a Number — "outward" complement of divisors
- 55680 Prime Factorization — decompose into prime building blocks
- Find GCF of 55680 and another number
- Find LCM of 55680 and another number
- Is 55680 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