Divisors of 12690: All 32 Factors

Quick Answer

12690 has 32 divisors (factors): 1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 47, 54, 90, 94, 135, 141, 235, 270, 282, 423, 470, 705, 846, 1269, 1410, 2115, 2538, 4230, 6345, 12690.

Sum: 34560.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 47, 54, 90, 94, 135, 141, 235, 270, 282, 423, 470, 705, 846, 1269, 1410, 2115, 2538, 4230, 6345, 12690

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 12690

The number 12690 has 32 divisors:

1,  2,  3,  5,  6,  9,  10,  15,  18,  27,  30,  45,  47,  54,  90,  94,  135,  141,  235,  270,  282,  423,  470,  705,  846,  1269,  1410,  2115,  2538,  4230,  6345,  12690

Divisor Pairs of 12690

Each pair multiplies to 12690:

Factor 1×Factor 2=Product
1×12690=12690
2×6345=12690
3×4230=12690
5×2538=12690
6×2115=12690
9×1410=12690
10×1269=12690
15×846=12690
18×705=12690
27×470=12690
30×423=12690
45×282=12690
47×270=12690
54×235=12690
90×141=12690
94×135=12690

Number of Divisors

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

Sum of Divisors

σ(12690) = 1 + 2 + 3 + 5 + 6 + 9 + 10 + 15 + 18 + 27 + 30 + 45 + 47 + 54 + 90 + 94 + 135 + 141 + 235 + 270 + 282 + 423 + 470 + 705 + 846 + 1269 + 1410 + 2115 + 2538 + 4230 + 6345 + 12690 = 34560

Properties of 12690

  • 12690 is composite.
  • 12690 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 34560.

Common Divisors with Another Number?

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

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

  1. 1 divides 12690 (12690 ÷ 1 = 12690) → pair (1, 12690)
  2. 2 divides 12690 (12690 ÷ 2 = 6345) → pair (2, 6345)
  3. 3 divides 12690 (12690 ÷ 3 = 4230) → pair (3, 4230)
  4. 5 divides 12690 (12690 ÷ 5 = 2538) → pair (5, 2538)
  5. 6 divides 12690 (12690 ÷ 6 = 2115) → pair (6, 2115)
  6. 9 divides 12690 (12690 ÷ 9 = 1410) → pair (9, 1410)
  7. 10 divides 12690 (12690 ÷ 10 = 1269) → pair (10, 1269)
  8. 15 divides 12690 (12690 ÷ 15 = 846) → pair (15, 846)
  9. 18 divides 12690 (12690 ÷ 18 = 705) → pair (18, 705)
  10. 27 divides 12690 (12690 ÷ 27 = 470) → pair (27, 470)
  11. 30 divides 12690 (12690 ÷ 30 = 423) → pair (30, 423)
  12. 45 divides 12690 (12690 ÷ 45 = 282) → pair (45, 282)
  13. 47 divides 12690 (12690 ÷ 47 = 270) → pair (47, 270)
  14. 54 divides 12690 (12690 ÷ 54 = 235) → pair (54, 235)
  15. 90 divides 12690 (12690 ÷ 90 = 141) → pair (90, 141)
  16. 94 divides 12690 (12690 ÷ 94 = 135) → pair (94, 135)
  17. Collect all unique values: {1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 47, 54, 90, 94, 135, 141, 235, 270, 282, 423, 470, 705, 846, 1269, 1410, 2115, 2538, 4230, 6345, 12690} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 5 + 6 + 9 + 10 + 15 + 18 + 27 + 30 + 45 + 47 + 54 + 90 + 94 + 135 + 141 + 235 + 270 + 282 + 423 + 470 + 705 + 846 + 1269 + 1410 + 2115 + 2538 + 4230 + 6345 + 12690 = 34560.

Nearby Examples

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

Related Operations for 12690

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