Divisors of 5160: All 32 Factors

Quick Answer

5160 has 32 divisors (factors): 1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 20, 24, 30, 40, 43, 60, 86, 120, 129, 172, 215, 258, 344, 430, 516, 645, 860, 1032, 1290, 1720, 2580, 5160.

Sum: 15840.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 20, 24, 30, 40, 43, 60, 86, 120, 129, 172, 215, 258, 344, 430, 516, 645, 860, 1032, 1290, 1720, 2580, 5160

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 5160

The number 5160 has 32 divisors:

1,  2,  3,  4,  5,  6,  8,  10,  12,  15,  20,  24,  30,  40,  43,  60,  86,  120,  129,  172,  215,  258,  344,  430,  516,  645,  860,  1032,  1290,  1720,  2580,  5160

Divisor Pairs of 5160

Each pair multiplies to 5160:

Factor 1×Factor 2=Product
1×5160=5160
2×2580=5160
3×1720=5160
4×1290=5160
5×1032=5160
6×860=5160
8×645=5160
10×516=5160
12×430=5160
15×344=5160
20×258=5160
24×215=5160
30×172=5160
40×129=5160
43×120=5160
60×86=5160

Number of Divisors

The number 5160 has 32 divisors, written as τ(5160) = 32 in number theory.

Sum of Divisors

σ(5160) = 1 + 2 + 3 + 4 + 5 + 6 + 8 + 10 + 12 + 15 + 20 + 24 + 30 + 40 + 43 + 60 + 86 + 120 + 129 + 172 + 215 + 258 + 344 + 430 + 516 + 645 + 860 + 1032 + 1290 + 1720 + 2580 + 5160 = 15840

Properties of 5160

  • 5160 is composite.
  • 5160 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 15840.

Common Divisors with Another Number?

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

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

  1. 1 divides 5160 (5160 ÷ 1 = 5160) → pair (1, 5160)
  2. 2 divides 5160 (5160 ÷ 2 = 2580) → pair (2, 2580)
  3. 3 divides 5160 (5160 ÷ 3 = 1720) → pair (3, 1720)
  4. 4 divides 5160 (5160 ÷ 4 = 1290) → pair (4, 1290)
  5. 5 divides 5160 (5160 ÷ 5 = 1032) → pair (5, 1032)
  6. 6 divides 5160 (5160 ÷ 6 = 860) → pair (6, 860)
  7. 8 divides 5160 (5160 ÷ 8 = 645) → pair (8, 645)
  8. 10 divides 5160 (5160 ÷ 10 = 516) → pair (10, 516)
  9. 12 divides 5160 (5160 ÷ 12 = 430) → pair (12, 430)
  10. 15 divides 5160 (5160 ÷ 15 = 344) → pair (15, 344)
  11. 20 divides 5160 (5160 ÷ 20 = 258) → pair (20, 258)
  12. 24 divides 5160 (5160 ÷ 24 = 215) → pair (24, 215)
  13. 30 divides 5160 (5160 ÷ 30 = 172) → pair (30, 172)
  14. 40 divides 5160 (5160 ÷ 40 = 129) → pair (40, 129)
  15. 43 divides 5160 (5160 ÷ 43 = 120) → pair (43, 120)
  16. 60 divides 5160 (5160 ÷ 60 = 86) → pair (60, 86)
  17. Collect all unique values: {1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 20, 24, 30, 40, 43, 60, 86, 120, 129, 172, 215, 258, 344, 430, 516, 645, 860, 1032, 1290, 1720, 2580, 5160} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 4 + 5 + 6 + 8 + 10 + 12 + 15 + 20 + 24 + 30 + 40 + 43 + 60 + 86 + 120 + 129 + 172 + 215 + 258 + 344 + 430 + 516 + 645 + 860 + 1032 + 1290 + 1720 + 2580 + 5160 = 15840.

Nearby Examples

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

Related Operations for 5160

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