Divisors of 12300: All 36 Factors

Quick Answer

12300 has 36 divisors (factors): 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 25, 30, 41, 50, 60, 75, 82, 100, 123, 150, 164, 205, 246, 300, 410, 492, 615, 820, 1025, 1230, 2050, 2460, 3075, 4100, 6150, 12300.

Sum: 36456.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 25, 30, 41, 50, 60, 75, 82, 100, 123, 150, 164, 205, 246, 300, 410, 492, 615, 820, 1025, 1230, 2050, 2460, 3075, 4100, 6150, 12300

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 12300

The number 12300 has 36 divisors:

1,  2,  3,  4,  5,  6,  10,  12,  15,  20,  25,  30,  41,  50,  60,  75,  82,  100,  123,  150,  164,  205,  246,  300,  410,  492,  615,  820,  1025,  1230,  2050,  2460,  3075,  4100,  6150,  12300

Divisor Pairs of 12300

Each pair multiplies to 12300:

Factor 1×Factor 2=Product
1×12300=12300
2×6150=12300
3×4100=12300
4×3075=12300
5×2460=12300
6×2050=12300
10×1230=12300
12×1025=12300
15×820=12300
20×615=12300
25×492=12300
30×410=12300
41×300=12300
50×246=12300
60×205=12300
75×164=12300
82×150=12300
100×123=12300

Number of Divisors

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

Sum of Divisors

σ(12300) = 1 + 2 + 3 + 4 + 5 + 6 + 10 + 12 + 15 + 20 + 25 + 30 + 41 + 50 + 60 + 75 + 82 + 100 + 123 + 150 + 164 + 205 + 246 + 300 + 410 + 492 + 615 + 820 + 1025 + 1230 + 2050 + 2460 + 3075 + 4100 + 6150 + 12300 = 36456

Properties of 12300

  • 12300 is composite.
  • 12300 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 36456.

Common Divisors with Another Number?

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

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

  1. 1 divides 12300 (12300 ÷ 1 = 12300) → pair (1, 12300)
  2. 2 divides 12300 (12300 ÷ 2 = 6150) → pair (2, 6150)
  3. 3 divides 12300 (12300 ÷ 3 = 4100) → pair (3, 4100)
  4. 4 divides 12300 (12300 ÷ 4 = 3075) → pair (4, 3075)
  5. 5 divides 12300 (12300 ÷ 5 = 2460) → pair (5, 2460)
  6. 6 divides 12300 (12300 ÷ 6 = 2050) → pair (6, 2050)
  7. 10 divides 12300 (12300 ÷ 10 = 1230) → pair (10, 1230)
  8. 12 divides 12300 (12300 ÷ 12 = 1025) → pair (12, 1025)
  9. 15 divides 12300 (12300 ÷ 15 = 820) → pair (15, 820)
  10. 20 divides 12300 (12300 ÷ 20 = 615) → pair (20, 615)
  11. 25 divides 12300 (12300 ÷ 25 = 492) → pair (25, 492)
  12. 30 divides 12300 (12300 ÷ 30 = 410) → pair (30, 410)
  13. 41 divides 12300 (12300 ÷ 41 = 300) → pair (41, 300)
  14. 50 divides 12300 (12300 ÷ 50 = 246) → pair (50, 246)
  15. 60 divides 12300 (12300 ÷ 60 = 205) → pair (60, 205)
  16. 75 divides 12300 (12300 ÷ 75 = 164) → pair (75, 164)
  17. 82 divides 12300 (12300 ÷ 82 = 150) → pair (82, 150)
  18. 100 divides 12300 (12300 ÷ 100 = 123) → pair (100, 123)
  19. Collect all unique values: {1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 25, 30, 41, 50, 60, 75, 82, 100, 123, 150, 164, 205, 246, 300, 410, 492, 615, 820, 1025, 1230, 2050, 2460, 3075, 4100, 6150, 12300} — total 36 divisors.
  20. Sum: 1 + 2 + 3 + 4 + 5 + 6 + 10 + 12 + 15 + 20 + 25 + 30 + 41 + 50 + 60 + 75 + 82 + 100 + 123 + 150 + 164 + 205 + 246 + 300 + 410 + 492 + 615 + 820 + 1025 + 1230 + 2050 + 2460 + 3075 + 4100 + 6150 + 12300 = 36456.

Nearby Examples

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

Related Operations for 12300

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