Divisors of 20370: All 32 Factors

Quick Answer

20370 has 32 divisors (factors): 1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 97, 105, 194, 210, 291, 485, 582, 679, 970, 1358, 1455, 2037, 2910, 3395, 4074, 6790, 10185, 20370.

Sum: 56448.

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, 70, 97, 105, 194, 210, 291, 485, 582, 679, 970, 1358, 1455, 2037, 2910, 3395, 4074, 6790, 10185, 20370

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 20370

The number 20370 has 32 divisors:

1,  2,  3,  5,  6,  7,  10,  14,  15,  21,  30,  35,  42,  70,  97,  105,  194,  210,  291,  485,  582,  679,  970,  1358,  1455,  2037,  2910,  3395,  4074,  6790,  10185,  20370

Divisor Pairs of 20370

Each pair multiplies to 20370:

Factor 1×Factor 2=Product
1×20370=20370
2×10185=20370
3×6790=20370
5×4074=20370
6×3395=20370
7×2910=20370
10×2037=20370
14×1455=20370
15×1358=20370
21×970=20370
30×679=20370
35×582=20370
42×485=20370
70×291=20370
97×210=20370
105×194=20370

Number of Divisors

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

Sum of Divisors

σ(20370) = 1 + 2 + 3 + 5 + 6 + 7 + 10 + 14 + 15 + 21 + 30 + 35 + 42 + 70 + 97 + 105 + 194 + 210 + 291 + 485 + 582 + 679 + 970 + 1358 + 1455 + 2037 + 2910 + 3395 + 4074 + 6790 + 10185 + 20370 = 56448

Properties of 20370

  • 20370 is composite.
  • 20370 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 56448.

Common Divisors with Another Number?

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

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

  1. 1 divides 20370 (20370 ÷ 1 = 20370) → pair (1, 20370)
  2. 2 divides 20370 (20370 ÷ 2 = 10185) → pair (2, 10185)
  3. 3 divides 20370 (20370 ÷ 3 = 6790) → pair (3, 6790)
  4. 5 divides 20370 (20370 ÷ 5 = 4074) → pair (5, 4074)
  5. 6 divides 20370 (20370 ÷ 6 = 3395) → pair (6, 3395)
  6. 7 divides 20370 (20370 ÷ 7 = 2910) → pair (7, 2910)
  7. 10 divides 20370 (20370 ÷ 10 = 2037) → pair (10, 2037)
  8. 14 divides 20370 (20370 ÷ 14 = 1455) → pair (14, 1455)
  9. 15 divides 20370 (20370 ÷ 15 = 1358) → pair (15, 1358)
  10. 21 divides 20370 (20370 ÷ 21 = 970) → pair (21, 970)
  11. 30 divides 20370 (20370 ÷ 30 = 679) → pair (30, 679)
  12. 35 divides 20370 (20370 ÷ 35 = 582) → pair (35, 582)
  13. 42 divides 20370 (20370 ÷ 42 = 485) → pair (42, 485)
  14. 70 divides 20370 (20370 ÷ 70 = 291) → pair (70, 291)
  15. 97 divides 20370 (20370 ÷ 97 = 210) → pair (97, 210)
  16. 105 divides 20370 (20370 ÷ 105 = 194) → pair (105, 194)
  17. Collect all unique values: {1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 97, 105, 194, 210, 291, 485, 582, 679, 970, 1358, 1455, 2037, 2910, 3395, 4074, 6790, 10185, 20370} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 5 + 6 + 7 + 10 + 14 + 15 + 21 + 30 + 35 + 42 + 70 + 97 + 105 + 194 + 210 + 291 + 485 + 582 + 679 + 970 + 1358 + 1455 + 2037 + 2910 + 3395 + 4074 + 6790 + 10185 + 20370 = 56448.

Nearby Examples

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

Related Operations for 20370

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