Divisors of 12160: All 32 Factors

Quick Answer

12160 has 32 divisors (factors): 1, 2, 4, 5, 8, 10, 16, 19, 20, 32, 38, 40, 64, 76, 80, 95, 128, 152, 160, 190, 304, 320, 380, 608, 640, 760, 1216, 1520, 2432, 3040, 6080, 12160.

Sum: 30600.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 4, 5, 8, 10, 16, 19, 20, 32, 38, 40, 64, 76, 80, 95, 128, 152, 160, 190, 304, 320, 380, 608, 640, 760, 1216, 1520, 2432, 3040, 6080, 12160

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 12160

The number 12160 has 32 divisors:

1,  2,  4,  5,  8,  10,  16,  19,  20,  32,  38,  40,  64,  76,  80,  95,  128,  152,  160,  190,  304,  320,  380,  608,  640,  760,  1216,  1520,  2432,  3040,  6080,  12160

Divisor Pairs of 12160

Each pair multiplies to 12160:

Factor 1×Factor 2=Product
1×12160=12160
2×6080=12160
4×3040=12160
5×2432=12160
8×1520=12160
10×1216=12160
16×760=12160
19×640=12160
20×608=12160
32×380=12160
38×320=12160
40×304=12160
64×190=12160
76×160=12160
80×152=12160
95×128=12160

Number of Divisors

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

Sum of Divisors

σ(12160) = 1 + 2 + 4 + 5 + 8 + 10 + 16 + 19 + 20 + 32 + 38 + 40 + 64 + 76 + 80 + 95 + 128 + 152 + 160 + 190 + 304 + 320 + 380 + 608 + 640 + 760 + 1216 + 1520 + 2432 + 3040 + 6080 + 12160 = 30600

Properties of 12160

  • 12160 is composite.
  • 12160 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 30600.

Common Divisors with Another Number?

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

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

  1. 1 divides 12160 (12160 ÷ 1 = 12160) → pair (1, 12160)
  2. 2 divides 12160 (12160 ÷ 2 = 6080) → pair (2, 6080)
  3. 4 divides 12160 (12160 ÷ 4 = 3040) → pair (4, 3040)
  4. 5 divides 12160 (12160 ÷ 5 = 2432) → pair (5, 2432)
  5. 8 divides 12160 (12160 ÷ 8 = 1520) → pair (8, 1520)
  6. 10 divides 12160 (12160 ÷ 10 = 1216) → pair (10, 1216)
  7. 16 divides 12160 (12160 ÷ 16 = 760) → pair (16, 760)
  8. 19 divides 12160 (12160 ÷ 19 = 640) → pair (19, 640)
  9. 20 divides 12160 (12160 ÷ 20 = 608) → pair (20, 608)
  10. 32 divides 12160 (12160 ÷ 32 = 380) → pair (32, 380)
  11. 38 divides 12160 (12160 ÷ 38 = 320) → pair (38, 320)
  12. 40 divides 12160 (12160 ÷ 40 = 304) → pair (40, 304)
  13. 64 divides 12160 (12160 ÷ 64 = 190) → pair (64, 190)
  14. 76 divides 12160 (12160 ÷ 76 = 160) → pair (76, 160)
  15. 80 divides 12160 (12160 ÷ 80 = 152) → pair (80, 152)
  16. 95 divides 12160 (12160 ÷ 95 = 128) → pair (95, 128)
  17. Collect all unique values: {1, 2, 4, 5, 8, 10, 16, 19, 20, 32, 38, 40, 64, 76, 80, 95, 128, 152, 160, 190, 304, 320, 380, 608, 640, 760, 1216, 1520, 2432, 3040, 6080, 12160} — total 32 divisors.
  18. Sum: 1 + 2 + 4 + 5 + 8 + 10 + 16 + 19 + 20 + 32 + 38 + 40 + 64 + 76 + 80 + 95 + 128 + 152 + 160 + 190 + 304 + 320 + 380 + 608 + 640 + 760 + 1216 + 1520 + 2432 + 3040 + 6080 + 12160 = 30600.

Nearby Examples

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

Related Operations for 12160

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