Divisors of 12810: All 32 Factors

Quick Answer

12810 has 32 divisors (factors): 1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 61, 70, 105, 122, 183, 210, 305, 366, 427, 610, 854, 915, 1281, 1830, 2135, 2562, 4270, 6405, 12810.

Sum: 35712.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 61, 70, 105, 122, 183, 210, 305, 366, 427, 610, 854, 915, 1281, 1830, 2135, 2562, 4270, 6405, 12810

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 12810

The number 12810 has 32 divisors:

1,  2,  3,  5,  6,  7,  10,  14,  15,  21,  30,  35,  42,  61,  70,  105,  122,  183,  210,  305,  366,  427,  610,  854,  915,  1281,  1830,  2135,  2562,  4270,  6405,  12810

Divisor Pairs of 12810

Each pair multiplies to 12810:

Factor 1×Factor 2=Product
1×12810=12810
2×6405=12810
3×4270=12810
5×2562=12810
6×2135=12810
7×1830=12810
10×1281=12810
14×915=12810
15×854=12810
21×610=12810
30×427=12810
35×366=12810
42×305=12810
61×210=12810
70×183=12810
105×122=12810

Number of Divisors

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

Sum of Divisors

σ(12810) = 1 + 2 + 3 + 5 + 6 + 7 + 10 + 14 + 15 + 21 + 30 + 35 + 42 + 61 + 70 + 105 + 122 + 183 + 210 + 305 + 366 + 427 + 610 + 854 + 915 + 1281 + 1830 + 2135 + 2562 + 4270 + 6405 + 12810 = 35712

Properties of 12810

  • 12810 is composite.
  • 12810 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 35712.

Common Divisors with Another Number?

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

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

  1. 1 divides 12810 (12810 ÷ 1 = 12810) → pair (1, 12810)
  2. 2 divides 12810 (12810 ÷ 2 = 6405) → pair (2, 6405)
  3. 3 divides 12810 (12810 ÷ 3 = 4270) → pair (3, 4270)
  4. 5 divides 12810 (12810 ÷ 5 = 2562) → pair (5, 2562)
  5. 6 divides 12810 (12810 ÷ 6 = 2135) → pair (6, 2135)
  6. 7 divides 12810 (12810 ÷ 7 = 1830) → pair (7, 1830)
  7. 10 divides 12810 (12810 ÷ 10 = 1281) → pair (10, 1281)
  8. 14 divides 12810 (12810 ÷ 14 = 915) → pair (14, 915)
  9. 15 divides 12810 (12810 ÷ 15 = 854) → pair (15, 854)
  10. 21 divides 12810 (12810 ÷ 21 = 610) → pair (21, 610)
  11. 30 divides 12810 (12810 ÷ 30 = 427) → pair (30, 427)
  12. 35 divides 12810 (12810 ÷ 35 = 366) → pair (35, 366)
  13. 42 divides 12810 (12810 ÷ 42 = 305) → pair (42, 305)
  14. 61 divides 12810 (12810 ÷ 61 = 210) → pair (61, 210)
  15. 70 divides 12810 (12810 ÷ 70 = 183) → pair (70, 183)
  16. 105 divides 12810 (12810 ÷ 105 = 122) → pair (105, 122)
  17. Collect all unique values: {1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 61, 70, 105, 122, 183, 210, 305, 366, 427, 610, 854, 915, 1281, 1830, 2135, 2562, 4270, 6405, 12810} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 5 + 6 + 7 + 10 + 14 + 15 + 21 + 30 + 35 + 42 + 61 + 70 + 105 + 122 + 183 + 210 + 305 + 366 + 427 + 610 + 854 + 915 + 1281 + 1830 + 2135 + 2562 + 4270 + 6405 + 12810 = 35712.

Nearby Examples

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

Related Operations for 12810

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