Divisors of 13140: All 36 Factors

Quick Answer

13140 has 36 divisors (factors): 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 30, 36, 45, 60, 73, 90, 146, 180, 219, 292, 365, 438, 657, 730, 876, 1095, 1314, 1460, 2190, 2628, 3285, 4380, 6570, 13140.

Sum: 40404.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 30, 36, 45, 60, 73, 90, 146, 180, 219, 292, 365, 438, 657, 730, 876, 1095, 1314, 1460, 2190, 2628, 3285, 4380, 6570, 13140

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 13140

The number 13140 has 36 divisors:

1,  2,  3,  4,  5,  6,  9,  10,  12,  15,  18,  20,  30,  36,  45,  60,  73,  90,  146,  180,  219,  292,  365,  438,  657,  730,  876,  1095,  1314,  1460,  2190,  2628,  3285,  4380,  6570,  13140

Divisor Pairs of 13140

Each pair multiplies to 13140:

Factor 1×Factor 2=Product
1×13140=13140
2×6570=13140
3×4380=13140
4×3285=13140
5×2628=13140
6×2190=13140
9×1460=13140
10×1314=13140
12×1095=13140
15×876=13140
18×730=13140
20×657=13140
30×438=13140
36×365=13140
45×292=13140
60×219=13140
73×180=13140
90×146=13140

Number of Divisors

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

Sum of Divisors

σ(13140) = 1 + 2 + 3 + 4 + 5 + 6 + 9 + 10 + 12 + 15 + 18 + 20 + 30 + 36 + 45 + 60 + 73 + 90 + 146 + 180 + 219 + 292 + 365 + 438 + 657 + 730 + 876 + 1095 + 1314 + 1460 + 2190 + 2628 + 3285 + 4380 + 6570 + 13140 = 40404

Properties of 13140

  • 13140 is composite.
  • 13140 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 40404.

Common Divisors with Another Number?

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

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

  1. 1 divides 13140 (13140 ÷ 1 = 13140) → pair (1, 13140)
  2. 2 divides 13140 (13140 ÷ 2 = 6570) → pair (2, 6570)
  3. 3 divides 13140 (13140 ÷ 3 = 4380) → pair (3, 4380)
  4. 4 divides 13140 (13140 ÷ 4 = 3285) → pair (4, 3285)
  5. 5 divides 13140 (13140 ÷ 5 = 2628) → pair (5, 2628)
  6. 6 divides 13140 (13140 ÷ 6 = 2190) → pair (6, 2190)
  7. 9 divides 13140 (13140 ÷ 9 = 1460) → pair (9, 1460)
  8. 10 divides 13140 (13140 ÷ 10 = 1314) → pair (10, 1314)
  9. 12 divides 13140 (13140 ÷ 12 = 1095) → pair (12, 1095)
  10. 15 divides 13140 (13140 ÷ 15 = 876) → pair (15, 876)
  11. 18 divides 13140 (13140 ÷ 18 = 730) → pair (18, 730)
  12. 20 divides 13140 (13140 ÷ 20 = 657) → pair (20, 657)
  13. 30 divides 13140 (13140 ÷ 30 = 438) → pair (30, 438)
  14. 36 divides 13140 (13140 ÷ 36 = 365) → pair (36, 365)
  15. 45 divides 13140 (13140 ÷ 45 = 292) → pair (45, 292)
  16. 60 divides 13140 (13140 ÷ 60 = 219) → pair (60, 219)
  17. 73 divides 13140 (13140 ÷ 73 = 180) → pair (73, 180)
  18. 90 divides 13140 (13140 ÷ 90 = 146) → pair (90, 146)
  19. Collect all unique values: {1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 30, 36, 45, 60, 73, 90, 146, 180, 219, 292, 365, 438, 657, 730, 876, 1095, 1314, 1460, 2190, 2628, 3285, 4380, 6570, 13140} — total 36 divisors.
  20. Sum: 1 + 2 + 3 + 4 + 5 + 6 + 9 + 10 + 12 + 15 + 18 + 20 + 30 + 36 + 45 + 60 + 73 + 90 + 146 + 180 + 219 + 292 + 365 + 438 + 657 + 730 + 876 + 1095 + 1314 + 1460 + 2190 + 2628 + 3285 + 4380 + 6570 + 13140 = 40404.

Nearby Examples

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

Related Operations for 13140

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