Divisors of 19710: All 32 Factors

Quick Answer

19710 has 32 divisors (factors): 1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 73, 90, 135, 146, 219, 270, 365, 438, 657, 730, 1095, 1314, 1971, 2190, 3285, 3942, 6570, 9855, 19710.

Sum: 53280.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 73, 90, 135, 146, 219, 270, 365, 438, 657, 730, 1095, 1314, 1971, 2190, 3285, 3942, 6570, 9855, 19710

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 19710

The number 19710 has 32 divisors:

1,  2,  3,  5,  6,  9,  10,  15,  18,  27,  30,  45,  54,  73,  90,  135,  146,  219,  270,  365,  438,  657,  730,  1095,  1314,  1971,  2190,  3285,  3942,  6570,  9855,  19710

Divisor Pairs of 19710

Each pair multiplies to 19710:

Factor 1×Factor 2=Product
1×19710=19710
2×9855=19710
3×6570=19710
5×3942=19710
6×3285=19710
9×2190=19710
10×1971=19710
15×1314=19710
18×1095=19710
27×730=19710
30×657=19710
45×438=19710
54×365=19710
73×270=19710
90×219=19710
135×146=19710

Number of Divisors

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

Sum of Divisors

σ(19710) = 1 + 2 + 3 + 5 + 6 + 9 + 10 + 15 + 18 + 27 + 30 + 45 + 54 + 73 + 90 + 135 + 146 + 219 + 270 + 365 + 438 + 657 + 730 + 1095 + 1314 + 1971 + 2190 + 3285 + 3942 + 6570 + 9855 + 19710 = 53280

Properties of 19710

  • 19710 is composite.
  • 19710 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 53280.

Common Divisors with Another Number?

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

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

  1. 1 divides 19710 (19710 ÷ 1 = 19710) → pair (1, 19710)
  2. 2 divides 19710 (19710 ÷ 2 = 9855) → pair (2, 9855)
  3. 3 divides 19710 (19710 ÷ 3 = 6570) → pair (3, 6570)
  4. 5 divides 19710 (19710 ÷ 5 = 3942) → pair (5, 3942)
  5. 6 divides 19710 (19710 ÷ 6 = 3285) → pair (6, 3285)
  6. 9 divides 19710 (19710 ÷ 9 = 2190) → pair (9, 2190)
  7. 10 divides 19710 (19710 ÷ 10 = 1971) → pair (10, 1971)
  8. 15 divides 19710 (19710 ÷ 15 = 1314) → pair (15, 1314)
  9. 18 divides 19710 (19710 ÷ 18 = 1095) → pair (18, 1095)
  10. 27 divides 19710 (19710 ÷ 27 = 730) → pair (27, 730)
  11. 30 divides 19710 (19710 ÷ 30 = 657) → pair (30, 657)
  12. 45 divides 19710 (19710 ÷ 45 = 438) → pair (45, 438)
  13. 54 divides 19710 (19710 ÷ 54 = 365) → pair (54, 365)
  14. 73 divides 19710 (19710 ÷ 73 = 270) → pair (73, 270)
  15. 90 divides 19710 (19710 ÷ 90 = 219) → pair (90, 219)
  16. 135 divides 19710 (19710 ÷ 135 = 146) → pair (135, 146)
  17. Collect all unique values: {1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 73, 90, 135, 146, 219, 270, 365, 438, 657, 730, 1095, 1314, 1971, 2190, 3285, 3942, 6570, 9855, 19710} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 5 + 6 + 9 + 10 + 15 + 18 + 27 + 30 + 45 + 54 + 73 + 90 + 135 + 146 + 219 + 270 + 365 + 438 + 657 + 730 + 1095 + 1314 + 1971 + 2190 + 3285 + 3942 + 6570 + 9855 + 19710 = 53280.

Nearby Examples

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

Related Operations for 19710

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