Divisors of 16560: All 60 Factors
Quick Answer
16560 has 60 divisors (factors): 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 16, 18, 20, 23, 24, 30, 36, 40, 45, 46, 48, 60, 69, 72, 80, 90, 92, 115, 120, 138, 144, 180, 184, 207, 230, 240, 276, 345, 360, 368, 414, 460, 552, 690, 720, 828, 920, 1035, 1104, 1380, 1656, 1840, 2070, 2760, 3312, 4140, 5520, 8280, 16560.
Sum: 58032.
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 16560
The number 16560 has 60 divisors:
1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 16, 18, 20, 23, 24, 30, 36, 40, 45, 46, 48, 60, 69, 72, 80, 90, 92, 115, 120, 138, 144, 180, 184, 207, 230, 240, 276, 345, 360, 368, 414, 460, 552, 690, 720, 828, 920, 1035, 1104, 1380, 1656, 1840, 2070, 2760, 3312, 4140, 5520, 8280, 16560
Divisor Pairs of 16560
Each pair multiplies to 16560:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 16560 | = | 16560 |
| 2 | × | 8280 | = | 16560 |
| 3 | × | 5520 | = | 16560 |
| 4 | × | 4140 | = | 16560 |
| 5 | × | 3312 | = | 16560 |
| 6 | × | 2760 | = | 16560 |
| 8 | × | 2070 | = | 16560 |
| 9 | × | 1840 | = | 16560 |
| 10 | × | 1656 | = | 16560 |
| 12 | × | 1380 | = | 16560 |
| 15 | × | 1104 | = | 16560 |
| 16 | × | 1035 | = | 16560 |
| 18 | × | 920 | = | 16560 |
| 20 | × | 828 | = | 16560 |
| 23 | × | 720 | = | 16560 |
| 24 | × | 690 | = | 16560 |
| 30 | × | 552 | = | 16560 |
| 36 | × | 460 | = | 16560 |
| 40 | × | 414 | = | 16560 |
| 45 | × | 368 | = | 16560 |
| 46 | × | 360 | = | 16560 |
| 48 | × | 345 | = | 16560 |
| 60 | × | 276 | = | 16560 |
| 69 | × | 240 | = | 16560 |
| 72 | × | 230 | = | 16560 |
| 80 | × | 207 | = | 16560 |
| 90 | × | 184 | = | 16560 |
| 92 | × | 180 | = | 16560 |
| 115 | × | 144 | = | 16560 |
| 120 | × | 138 | = | 16560 |
Number of Divisors
The number 16560 has 60 divisors, written as τ(16560) = 60 in number theory.
Sum of Divisors
σ(16560) = 1 + 2 + 3 + 4 + 5 + 6 + 8 + 9 + 10 + 12 + 15 + 16 + 18 + 20 + 23 + 24 + 30 + 36 + 40 + 45 + 46 + 48 + 60 + 69 + 72 + 80 + 90 + 92 + 115 + 120 + 138 + 144 + 180 + 184 + 207 + 230 + 240 + 276 + 345 + 360 + 368 + 414 + 460 + 552 + 690 + 720 + 828 + 920 + 1035 + 1104 + 1380 + 1656 + 1840 + 2070 + 2760 + 3312 + 4140 + 5520 + 8280 + 16560 = 58032
Prime Factorization of 16560
Properties of 16560
- 16560 is composite.
- 16560 is not a perfect square.
- Number of divisors: 60.
- Sum of divisors: 58032.
Common Divisors with Another Number?
Looking for the divisors that 16560 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 16560
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √16560 ≈ 128.69. If i divides 16560, then both i and 16560/i are divisors.
- 1 divides 16560 (16560 ÷ 1 = 16560) → pair (1, 16560)
- 2 divides 16560 (16560 ÷ 2 = 8280) → pair (2, 8280)
- 3 divides 16560 (16560 ÷ 3 = 5520) → pair (3, 5520)
- 4 divides 16560 (16560 ÷ 4 = 4140) → pair (4, 4140)
- 5 divides 16560 (16560 ÷ 5 = 3312) → pair (5, 3312)
- 6 divides 16560 (16560 ÷ 6 = 2760) → pair (6, 2760)
- 8 divides 16560 (16560 ÷ 8 = 2070) → pair (8, 2070)
- 9 divides 16560 (16560 ÷ 9 = 1840) → pair (9, 1840)
- 10 divides 16560 (16560 ÷ 10 = 1656) → pair (10, 1656)
- 12 divides 16560 (16560 ÷ 12 = 1380) → pair (12, 1380)
- 15 divides 16560 (16560 ÷ 15 = 1104) → pair (15, 1104)
- 16 divides 16560 (16560 ÷ 16 = 1035) → pair (16, 1035)
- 18 divides 16560 (16560 ÷ 18 = 920) → pair (18, 920)
- 20 divides 16560 (16560 ÷ 20 = 828) → pair (20, 828)
- 23 divides 16560 (16560 ÷ 23 = 720) → pair (23, 720)
- 24 divides 16560 (16560 ÷ 24 = 690) → pair (24, 690)
- 30 divides 16560 (16560 ÷ 30 = 552) → pair (30, 552)
- 36 divides 16560 (16560 ÷ 36 = 460) → pair (36, 460)
- 40 divides 16560 (16560 ÷ 40 = 414) → pair (40, 414)
- 45 divides 16560 (16560 ÷ 45 = 368) → pair (45, 368)
- 46 divides 16560 (16560 ÷ 46 = 360) → pair (46, 360)
- 48 divides 16560 (16560 ÷ 48 = 345) → pair (48, 345)
- 60 divides 16560 (16560 ÷ 60 = 276) → pair (60, 276)
- 69 divides 16560 (16560 ÷ 69 = 240) → pair (69, 240)
- 72 divides 16560 (16560 ÷ 72 = 230) → pair (72, 230)
- 80 divides 16560 (16560 ÷ 80 = 207) → pair (80, 207)
- 90 divides 16560 (16560 ÷ 90 = 184) → pair (90, 184)
- 92 divides 16560 (16560 ÷ 92 = 180) → pair (92, 180)
- 115 divides 16560 (16560 ÷ 115 = 144) → pair (115, 144)
- 120 divides 16560 (16560 ÷ 120 = 138) → pair (120, 138)
- Collect all unique values: {1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 16, 18, 20, 23, 24, 30, 36, 40, 45, 46, 48, 60, 69, 72, 80, 90, 92, 115, 120, 138, 144, 180, 184, 207, 230, 240, 276, 345, 360, 368, 414, 460, 552, 690, 720, 828, 920, 1035, 1104, 1380, 1656, 1840, 2070, 2760, 3312, 4140, 5520, 8280, 16560} — total 60 divisors.
- Sum: 1 + 2 + 3 + 4 + 5 + 6 + 8 + 9 + 10 + 12 + 15 + 16 + 18 + 20 + 23 + 24 + 30 + 36 + 40 + 45 + 46 + 48 + 60 + 69 + 72 + 80 + 90 + 92 + 115 + 120 + 138 + 144 + 180 + 184 + 207 + 230 + 240 + 276 + 345 + 360 + 368 + 414 + 460 + 552 + 690 + 720 + 828 + 920 + 1035 + 1104 + 1380 + 1656 + 1840 + 2070 + 2760 + 3312 + 4140 + 5520 + 8280 + 16560 = 58032.
Nearby Examples
Related Operations for 16560
- Multiples of a Number — "outward" complement of divisors
- 16560 Prime Factorization — decompose into prime building blocks
- Find GCF of 16560 and another number
- Find LCM of 16560 and another number
- Is 16560 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