Divisors of 12750: All 32 Factors

Quick Answer

12750 has 32 divisors (factors): 1, 2, 3, 5, 6, 10, 15, 17, 25, 30, 34, 50, 51, 75, 85, 102, 125, 150, 170, 250, 255, 375, 425, 510, 750, 850, 1275, 2125, 2550, 4250, 6375, 12750.

Sum: 33696.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 5, 6, 10, 15, 17, 25, 30, 34, 50, 51, 75, 85, 102, 125, 150, 170, 250, 255, 375, 425, 510, 750, 850, 1275, 2125, 2550, 4250, 6375, 12750

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 12750

The number 12750 has 32 divisors:

1,  2,  3,  5,  6,  10,  15,  17,  25,  30,  34,  50,  51,  75,  85,  102,  125,  150,  170,  250,  255,  375,  425,  510,  750,  850,  1275,  2125,  2550,  4250,  6375,  12750

Divisor Pairs of 12750

Each pair multiplies to 12750:

Factor 1×Factor 2=Product
1×12750=12750
2×6375=12750
3×4250=12750
5×2550=12750
6×2125=12750
10×1275=12750
15×850=12750
17×750=12750
25×510=12750
30×425=12750
34×375=12750
50×255=12750
51×250=12750
75×170=12750
85×150=12750
102×125=12750

Number of Divisors

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

Sum of Divisors

σ(12750) = 1 + 2 + 3 + 5 + 6 + 10 + 15 + 17 + 25 + 30 + 34 + 50 + 51 + 75 + 85 + 102 + 125 + 150 + 170 + 250 + 255 + 375 + 425 + 510 + 750 + 850 + 1275 + 2125 + 2550 + 4250 + 6375 + 12750 = 33696

Properties of 12750

  • 12750 is composite.
  • 12750 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 33696.

Common Divisors with Another Number?

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

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

  1. 1 divides 12750 (12750 ÷ 1 = 12750) → pair (1, 12750)
  2. 2 divides 12750 (12750 ÷ 2 = 6375) → pair (2, 6375)
  3. 3 divides 12750 (12750 ÷ 3 = 4250) → pair (3, 4250)
  4. 5 divides 12750 (12750 ÷ 5 = 2550) → pair (5, 2550)
  5. 6 divides 12750 (12750 ÷ 6 = 2125) → pair (6, 2125)
  6. 10 divides 12750 (12750 ÷ 10 = 1275) → pair (10, 1275)
  7. 15 divides 12750 (12750 ÷ 15 = 850) → pair (15, 850)
  8. 17 divides 12750 (12750 ÷ 17 = 750) → pair (17, 750)
  9. 25 divides 12750 (12750 ÷ 25 = 510) → pair (25, 510)
  10. 30 divides 12750 (12750 ÷ 30 = 425) → pair (30, 425)
  11. 34 divides 12750 (12750 ÷ 34 = 375) → pair (34, 375)
  12. 50 divides 12750 (12750 ÷ 50 = 255) → pair (50, 255)
  13. 51 divides 12750 (12750 ÷ 51 = 250) → pair (51, 250)
  14. 75 divides 12750 (12750 ÷ 75 = 170) → pair (75, 170)
  15. 85 divides 12750 (12750 ÷ 85 = 150) → pair (85, 150)
  16. 102 divides 12750 (12750 ÷ 102 = 125) → pair (102, 125)
  17. Collect all unique values: {1, 2, 3, 5, 6, 10, 15, 17, 25, 30, 34, 50, 51, 75, 85, 102, 125, 150, 170, 250, 255, 375, 425, 510, 750, 850, 1275, 2125, 2550, 4250, 6375, 12750} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 5 + 6 + 10 + 15 + 17 + 25 + 30 + 34 + 50 + 51 + 75 + 85 + 102 + 125 + 150 + 170 + 250 + 255 + 375 + 425 + 510 + 750 + 850 + 1275 + 2125 + 2550 + 4250 + 6375 + 12750 = 33696.

Nearby Examples

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

Related Operations for 12750

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