Divisors of 12900: All 36 Factors

Quick Answer

12900 has 36 divisors (factors): 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 25, 30, 43, 50, 60, 75, 86, 100, 129, 150, 172, 215, 258, 300, 430, 516, 645, 860, 1075, 1290, 2150, 2580, 3225, 4300, 6450, 12900.

Sum: 38192.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 25, 30, 43, 50, 60, 75, 86, 100, 129, 150, 172, 215, 258, 300, 430, 516, 645, 860, 1075, 1290, 2150, 2580, 3225, 4300, 6450, 12900

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 12900

The number 12900 has 36 divisors:

1,  2,  3,  4,  5,  6,  10,  12,  15,  20,  25,  30,  43,  50,  60,  75,  86,  100,  129,  150,  172,  215,  258,  300,  430,  516,  645,  860,  1075,  1290,  2150,  2580,  3225,  4300,  6450,  12900

Divisor Pairs of 12900

Each pair multiplies to 12900:

Factor 1×Factor 2=Product
1×12900=12900
2×6450=12900
3×4300=12900
4×3225=12900
5×2580=12900
6×2150=12900
10×1290=12900
12×1075=12900
15×860=12900
20×645=12900
25×516=12900
30×430=12900
43×300=12900
50×258=12900
60×215=12900
75×172=12900
86×150=12900
100×129=12900

Number of Divisors

The number 12900 has 36 divisors, written as τ(12900) = 36 in number theory.

Sum of Divisors

σ(12900) = 1 + 2 + 3 + 4 + 5 + 6 + 10 + 12 + 15 + 20 + 25 + 30 + 43 + 50 + 60 + 75 + 86 + 100 + 129 + 150 + 172 + 215 + 258 + 300 + 430 + 516 + 645 + 860 + 1075 + 1290 + 2150 + 2580 + 3225 + 4300 + 6450 + 12900 = 38192

Properties of 12900

  • 12900 is composite.
  • 12900 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 38192.

Common Divisors with Another Number?

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

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

  1. 1 divides 12900 (12900 ÷ 1 = 12900) → pair (1, 12900)
  2. 2 divides 12900 (12900 ÷ 2 = 6450) → pair (2, 6450)
  3. 3 divides 12900 (12900 ÷ 3 = 4300) → pair (3, 4300)
  4. 4 divides 12900 (12900 ÷ 4 = 3225) → pair (4, 3225)
  5. 5 divides 12900 (12900 ÷ 5 = 2580) → pair (5, 2580)
  6. 6 divides 12900 (12900 ÷ 6 = 2150) → pair (6, 2150)
  7. 10 divides 12900 (12900 ÷ 10 = 1290) → pair (10, 1290)
  8. 12 divides 12900 (12900 ÷ 12 = 1075) → pair (12, 1075)
  9. 15 divides 12900 (12900 ÷ 15 = 860) → pair (15, 860)
  10. 20 divides 12900 (12900 ÷ 20 = 645) → pair (20, 645)
  11. 25 divides 12900 (12900 ÷ 25 = 516) → pair (25, 516)
  12. 30 divides 12900 (12900 ÷ 30 = 430) → pair (30, 430)
  13. 43 divides 12900 (12900 ÷ 43 = 300) → pair (43, 300)
  14. 50 divides 12900 (12900 ÷ 50 = 258) → pair (50, 258)
  15. 60 divides 12900 (12900 ÷ 60 = 215) → pair (60, 215)
  16. 75 divides 12900 (12900 ÷ 75 = 172) → pair (75, 172)
  17. 86 divides 12900 (12900 ÷ 86 = 150) → pair (86, 150)
  18. 100 divides 12900 (12900 ÷ 100 = 129) → pair (100, 129)
  19. Collect all unique values: {1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 25, 30, 43, 50, 60, 75, 86, 100, 129, 150, 172, 215, 258, 300, 430, 516, 645, 860, 1075, 1290, 2150, 2580, 3225, 4300, 6450, 12900} — total 36 divisors.
  20. Sum: 1 + 2 + 3 + 4 + 5 + 6 + 10 + 12 + 15 + 20 + 25 + 30 + 43 + 50 + 60 + 75 + 86 + 100 + 129 + 150 + 172 + 215 + 258 + 300 + 430 + 516 + 645 + 860 + 1075 + 1290 + 2150 + 2580 + 3225 + 4300 + 6450 + 12900 = 38192.

Nearby Examples

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

Related Operations for 12900

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