Divisors of 12480: All 56 Factors

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 12480

The number 12480 has 56 divisors:

1,  2,  3,  4,  5,  6,  8,  10,  12,  13,  15,  16,  20,  24,  26,  30,  32,  39,  40,  48,  52,  60,  64,  65,  78,  80,  96,  104,  120,  130,  156,  160,  192,  195,  208,  240,  260,  312,  320,  390,  416,  480,  520,  624,  780,  832,  960,  1040,  1248,  1560,  2080,  2496,  3120,  4160,  6240,  12480

Divisor Pairs of 12480

Each pair multiplies to 12480:

Number of Divisors

The number 12480 has 56 divisors, written as τ(12480) = 56 in number theory.

Sum of Divisors

σ(12480) = 1 + 2 + 3 + 4 + 5 + 6 + 8 + 10 + 12 + 13 + 15 + 16 + 20 + 24 + 26 + 30 + 32 + 39 + 40 + 48 + 52 + 60 + 64 + 65 + 78 + 80 + 96 + 104 + 120 + 130 + 156 + 160 + 192 + 195 + 208 + 240 + 260 + 312 + 320 + 390 + 416 + 480 + 520 + 624 + 780 + 832 + 960 + 1040 + 1248 + 1560 + 2080 + 2496 + 3120 + 4160 + 6240 + 12480 = 42672

Prime Factorization of 12480

See the full prime factorization calculator →

Properties of 12480

• 12480 is composite.
• 12480 is not a perfect square.
• Number of divisors: 56.
• Sum of divisors: 42672.

Common Divisors with Another Number?

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

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

1. 1 divides 12480 (12480 ÷ 1 = 12480) → pair (1, 12480)
2. 2 divides 12480 (12480 ÷ 2 = 6240) → pair (2, 6240)
3. 3 divides 12480 (12480 ÷ 3 = 4160) → pair (3, 4160)
4. 4 divides 12480 (12480 ÷ 4 = 3120) → pair (4, 3120)
5. 5 divides 12480 (12480 ÷ 5 = 2496) → pair (5, 2496)
6. 6 divides 12480 (12480 ÷ 6 = 2080) → pair (6, 2080)
7. 8 divides 12480 (12480 ÷ 8 = 1560) → pair (8, 1560)
8. 10 divides 12480 (12480 ÷ 10 = 1248) → pair (10, 1248)
9. 12 divides 12480 (12480 ÷ 12 = 1040) → pair (12, 1040)
10. 13 divides 12480 (12480 ÷ 13 = 960) → pair (13, 960)
11. 15 divides 12480 (12480 ÷ 15 = 832) → pair (15, 832)
12. 16 divides 12480 (12480 ÷ 16 = 780) → pair (16, 780)
13. 20 divides 12480 (12480 ÷ 20 = 624) → pair (20, 624)
14. 24 divides 12480 (12480 ÷ 24 = 520) → pair (24, 520)
15. 26 divides 12480 (12480 ÷ 26 = 480) → pair (26, 480)
16. 30 divides 12480 (12480 ÷ 30 = 416) → pair (30, 416)
17. 32 divides 12480 (12480 ÷ 32 = 390) → pair (32, 390)
18. 39 divides 12480 (12480 ÷ 39 = 320) → pair (39, 320)
19. 40 divides 12480 (12480 ÷ 40 = 312) → pair (40, 312)
20. 48 divides 12480 (12480 ÷ 48 = 260) → pair (48, 260)
21. 52 divides 12480 (12480 ÷ 52 = 240) → pair (52, 240)
22. 60 divides 12480 (12480 ÷ 60 = 208) → pair (60, 208)
23. 64 divides 12480 (12480 ÷ 64 = 195) → pair (64, 195)
24. 65 divides 12480 (12480 ÷ 65 = 192) → pair (65, 192)
25. 78 divides 12480 (12480 ÷ 78 = 160) → pair (78, 160)
26. 80 divides 12480 (12480 ÷ 80 = 156) → pair (80, 156)
27. 96 divides 12480 (12480 ÷ 96 = 130) → pair (96, 130)
28. 104 divides 12480 (12480 ÷ 104 = 120) → pair (104, 120)
29. Collect all unique values: {1, 2, 3, 4, 5, 6, 8, 10, 12, 13, 15, 16, 20, 24, 26, 30, 32, 39, 40, 48, 52, 60, 64, 65, 78, 80, 96, 104, 120, 130, 156, 160, 192, 195, 208, 240, 260, 312, 320, 390, 416, 480, 520, 624, 780, 832, 960, 1040, 1248, 1560, 2080, 2496, 3120, 4160, 6240, 12480} — total 56 divisors.
30. Sum: 1 + 2 + 3 + 4 + 5 + 6 + 8 + 10 + 12 + 13 + 15 + 16 + 20 + 24 + 26 + 30 + 32 + 39 + 40 + 48 + 52 + 60 + 64 + 65 + 78 + 80 + 96 + 104 + 120 + 130 + 156 + 160 + 192 + 195 + 208 + 240 + 260 + 312 + 320 + 390 + 416 + 480 + 520 + 624 + 780 + 832 + 960 + 1040 + 1248 + 1560 + 2080 + 2496 + 3120 + 4160 + 6240 + 12480 = 42672.

Nearby Examples

Related Operations for 12480

• Multiples of a Number — "outward" complement of divisors
• 12480 Prime Factorization — decompose into prime building blocks
• Find GCF of 12480 and another number
• Find LCM of 12480 and another number
• Is 12480 a perfect square? (odd divisor count ⇔ yes)

See also our tables of divisors:

• Table of all divisors from 1 to 100
• Table of all divisors from 1 to 500
• Table of all divisors from 1 to 1,000
• Table of all divisors from 1 to 10,000

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.

References

• [1] Divisor (Wikipedia)
• [2] Divisor function (Wikipedia)
• [3] Divisor (Wolfram MathWorld)

Divisors Calculation Examples

Find all divisors of these numbers: