Divisors of 5520: All 40 Factors

Quick Answer

5520 has 40 divisors (factors): 1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 23, 24, 30, 40, 46, 48, 60, 69, 80, 92, 115, 120, 138, 184, 230, 240, 276, 345, 368, 460, 552, 690, 920, 1104, 1380, 1840, 2760, 5520.

Sum: 17856.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
40 divisors
1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 23, 24, 30, 40, 46, 48, 60, 69, 80, 92, 115, 120, 138, 184, 230, 240, 276, 345, 368, 460, 552, 690, 920, 1104, 1380, 1840, 2760, 5520

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 5520

The number 5520 has 40 divisors:

1,  2,  3,  4,  5,  6,  8,  10,  12,  15,  16,  20,  23,  24,  30,  40,  46,  48,  60,  69,  80,  92,  115,  120,  138,  184,  230,  240,  276,  345,  368,  460,  552,  690,  920,  1104,  1380,  1840,  2760,  5520

Divisor Pairs of 5520

Each pair multiplies to 5520:

Factor 1×Factor 2=Product
1×5520=5520
2×2760=5520
3×1840=5520
4×1380=5520
5×1104=5520
6×920=5520
8×690=5520
10×552=5520
12×460=5520
15×368=5520
16×345=5520
20×276=5520
23×240=5520
24×230=5520
30×184=5520
40×138=5520
46×120=5520
48×115=5520
60×92=5520
69×80=5520

Number of Divisors

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

Sum of Divisors

σ(5520) = 1 + 2 + 3 + 4 + 5 + 6 + 8 + 10 + 12 + 15 + 16 + 20 + 23 + 24 + 30 + 40 + 46 + 48 + 60 + 69 + 80 + 92 + 115 + 120 + 138 + 184 + 230 + 240 + 276 + 345 + 368 + 460 + 552 + 690 + 920 + 1104 + 1380 + 1840 + 2760 + 5520 = 17856

Properties of 5520

  • 5520 is composite.
  • 5520 is not a perfect square.
  • Number of divisors: 40.
  • Sum of divisors: 17856.

Common Divisors with Another Number?

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

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

  1. 1 divides 5520 (5520 ÷ 1 = 5520) → pair (1, 5520)
  2. 2 divides 5520 (5520 ÷ 2 = 2760) → pair (2, 2760)
  3. 3 divides 5520 (5520 ÷ 3 = 1840) → pair (3, 1840)
  4. 4 divides 5520 (5520 ÷ 4 = 1380) → pair (4, 1380)
  5. 5 divides 5520 (5520 ÷ 5 = 1104) → pair (5, 1104)
  6. 6 divides 5520 (5520 ÷ 6 = 920) → pair (6, 920)
  7. 8 divides 5520 (5520 ÷ 8 = 690) → pair (8, 690)
  8. 10 divides 5520 (5520 ÷ 10 = 552) → pair (10, 552)
  9. 12 divides 5520 (5520 ÷ 12 = 460) → pair (12, 460)
  10. 15 divides 5520 (5520 ÷ 15 = 368) → pair (15, 368)
  11. 16 divides 5520 (5520 ÷ 16 = 345) → pair (16, 345)
  12. 20 divides 5520 (5520 ÷ 20 = 276) → pair (20, 276)
  13. 23 divides 5520 (5520 ÷ 23 = 240) → pair (23, 240)
  14. 24 divides 5520 (5520 ÷ 24 = 230) → pair (24, 230)
  15. 30 divides 5520 (5520 ÷ 30 = 184) → pair (30, 184)
  16. 40 divides 5520 (5520 ÷ 40 = 138) → pair (40, 138)
  17. 46 divides 5520 (5520 ÷ 46 = 120) → pair (46, 120)
  18. 48 divides 5520 (5520 ÷ 48 = 115) → pair (48, 115)
  19. 60 divides 5520 (5520 ÷ 60 = 92) → pair (60, 92)
  20. 69 divides 5520 (5520 ÷ 69 = 80) → pair (69, 80)
  21. Collect all unique values: {1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 23, 24, 30, 40, 46, 48, 60, 69, 80, 92, 115, 120, 138, 184, 230, 240, 276, 345, 368, 460, 552, 690, 920, 1104, 1380, 1840, 2760, 5520} — total 40 divisors.
  22. Sum: 1 + 2 + 3 + 4 + 5 + 6 + 8 + 10 + 12 + 15 + 16 + 20 + 23 + 24 + 30 + 40 + 46 + 48 + 60 + 69 + 80 + 92 + 115 + 120 + 138 + 184 + 230 + 240 + 276 + 345 + 368 + 460 + 552 + 690 + 920 + 1104 + 1380 + 1840 + 2760 + 5520 = 17856.

Nearby Examples

ndivisors countsum σ(n)
360241170
24020744
18018546
14415403
12016360
1009217
9012234
8412224

Related Operations for 5520

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