Divisors of 15210: All 36 Factors

Quick Answer

15210 has 36 divisors (factors): 1, 2, 3, 5, 6, 9, 10, 13, 15, 18, 26, 30, 39, 45, 65, 78, 90, 117, 130, 169, 195, 234, 338, 390, 507, 585, 845, 1014, 1170, 1521, 1690, 2535, 3042, 5070, 7605, 15210.

Sum: 42822.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 3, 5, 6, 9, 10, 13, 15, 18, 26, 30, 39, 45, 65, 78, 90, 117, 130, 169, 195, 234, 338, 390, 507, 585, 845, 1014, 1170, 1521, 1690, 2535, 3042, 5070, 7605, 15210

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 15210

The number 15210 has 36 divisors:

1,  2,  3,  5,  6,  9,  10,  13,  15,  18,  26,  30,  39,  45,  65,  78,  90,  117,  130,  169,  195,  234,  338,  390,  507,  585,  845,  1014,  1170,  1521,  1690,  2535,  3042,  5070,  7605,  15210

Divisor Pairs of 15210

Each pair multiplies to 15210:

Factor 1×Factor 2=Product
1×15210=15210
2×7605=15210
3×5070=15210
5×3042=15210
6×2535=15210
9×1690=15210
10×1521=15210
13×1170=15210
15×1014=15210
18×845=15210
26×585=15210
30×507=15210
39×390=15210
45×338=15210
65×234=15210
78×195=15210
90×169=15210
117×130=15210

Number of Divisors

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

Sum of Divisors

σ(15210) = 1 + 2 + 3 + 5 + 6 + 9 + 10 + 13 + 15 + 18 + 26 + 30 + 39 + 45 + 65 + 78 + 90 + 117 + 130 + 169 + 195 + 234 + 338 + 390 + 507 + 585 + 845 + 1014 + 1170 + 1521 + 1690 + 2535 + 3042 + 5070 + 7605 + 15210 = 42822

Properties of 15210

  • 15210 is composite.
  • 15210 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 42822.

Common Divisors with Another Number?

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

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

  1. 1 divides 15210 (15210 ÷ 1 = 15210) → pair (1, 15210)
  2. 2 divides 15210 (15210 ÷ 2 = 7605) → pair (2, 7605)
  3. 3 divides 15210 (15210 ÷ 3 = 5070) → pair (3, 5070)
  4. 5 divides 15210 (15210 ÷ 5 = 3042) → pair (5, 3042)
  5. 6 divides 15210 (15210 ÷ 6 = 2535) → pair (6, 2535)
  6. 9 divides 15210 (15210 ÷ 9 = 1690) → pair (9, 1690)
  7. 10 divides 15210 (15210 ÷ 10 = 1521) → pair (10, 1521)
  8. 13 divides 15210 (15210 ÷ 13 = 1170) → pair (13, 1170)
  9. 15 divides 15210 (15210 ÷ 15 = 1014) → pair (15, 1014)
  10. 18 divides 15210 (15210 ÷ 18 = 845) → pair (18, 845)
  11. 26 divides 15210 (15210 ÷ 26 = 585) → pair (26, 585)
  12. 30 divides 15210 (15210 ÷ 30 = 507) → pair (30, 507)
  13. 39 divides 15210 (15210 ÷ 39 = 390) → pair (39, 390)
  14. 45 divides 15210 (15210 ÷ 45 = 338) → pair (45, 338)
  15. 65 divides 15210 (15210 ÷ 65 = 234) → pair (65, 234)
  16. 78 divides 15210 (15210 ÷ 78 = 195) → pair (78, 195)
  17. 90 divides 15210 (15210 ÷ 90 = 169) → pair (90, 169)
  18. 117 divides 15210 (15210 ÷ 117 = 130) → pair (117, 130)
  19. Collect all unique values: {1, 2, 3, 5, 6, 9, 10, 13, 15, 18, 26, 30, 39, 45, 65, 78, 90, 117, 130, 169, 195, 234, 338, 390, 507, 585, 845, 1014, 1170, 1521, 1690, 2535, 3042, 5070, 7605, 15210} — total 36 divisors.
  20. Sum: 1 + 2 + 3 + 5 + 6 + 9 + 10 + 13 + 15 + 18 + 26 + 30 + 39 + 45 + 65 + 78 + 90 + 117 + 130 + 169 + 195 + 234 + 338 + 390 + 507 + 585 + 845 + 1014 + 1170 + 1521 + 1690 + 2535 + 3042 + 5070 + 7605 + 15210 = 42822.

Nearby Examples

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

Related Operations for 15210

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