Divisors of 21330: All 32 Factors

Quick Answer

21330 has 32 divisors (factors): 1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 79, 90, 135, 158, 237, 270, 395, 474, 711, 790, 1185, 1422, 2133, 2370, 3555, 4266, 7110, 10665, 21330.

Sum: 57600.

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, 79, 90, 135, 158, 237, 270, 395, 474, 711, 790, 1185, 1422, 2133, 2370, 3555, 4266, 7110, 10665, 21330

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 21330

The number 21330 has 32 divisors:

1,  2,  3,  5,  6,  9,  10,  15,  18,  27,  30,  45,  54,  79,  90,  135,  158,  237,  270,  395,  474,  711,  790,  1185,  1422,  2133,  2370,  3555,  4266,  7110,  10665,  21330

Divisor Pairs of 21330

Each pair multiplies to 21330:

Factor 1×Factor 2=Product
1×21330=21330
2×10665=21330
3×7110=21330
5×4266=21330
6×3555=21330
9×2370=21330
10×2133=21330
15×1422=21330
18×1185=21330
27×790=21330
30×711=21330
45×474=21330
54×395=21330
79×270=21330
90×237=21330
135×158=21330

Number of Divisors

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

Sum of Divisors

σ(21330) = 1 + 2 + 3 + 5 + 6 + 9 + 10 + 15 + 18 + 27 + 30 + 45 + 54 + 79 + 90 + 135 + 158 + 237 + 270 + 395 + 474 + 711 + 790 + 1185 + 1422 + 2133 + 2370 + 3555 + 4266 + 7110 + 10665 + 21330 = 57600

Properties of 21330

  • 21330 is composite.
  • 21330 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 57600.

Common Divisors with Another Number?

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

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

  1. 1 divides 21330 (21330 ÷ 1 = 21330) → pair (1, 21330)
  2. 2 divides 21330 (21330 ÷ 2 = 10665) → pair (2, 10665)
  3. 3 divides 21330 (21330 ÷ 3 = 7110) → pair (3, 7110)
  4. 5 divides 21330 (21330 ÷ 5 = 4266) → pair (5, 4266)
  5. 6 divides 21330 (21330 ÷ 6 = 3555) → pair (6, 3555)
  6. 9 divides 21330 (21330 ÷ 9 = 2370) → pair (9, 2370)
  7. 10 divides 21330 (21330 ÷ 10 = 2133) → pair (10, 2133)
  8. 15 divides 21330 (21330 ÷ 15 = 1422) → pair (15, 1422)
  9. 18 divides 21330 (21330 ÷ 18 = 1185) → pair (18, 1185)
  10. 27 divides 21330 (21330 ÷ 27 = 790) → pair (27, 790)
  11. 30 divides 21330 (21330 ÷ 30 = 711) → pair (30, 711)
  12. 45 divides 21330 (21330 ÷ 45 = 474) → pair (45, 474)
  13. 54 divides 21330 (21330 ÷ 54 = 395) → pair (54, 395)
  14. 79 divides 21330 (21330 ÷ 79 = 270) → pair (79, 270)
  15. 90 divides 21330 (21330 ÷ 90 = 237) → pair (90, 237)
  16. 135 divides 21330 (21330 ÷ 135 = 158) → pair (135, 158)
  17. Collect all unique values: {1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 79, 90, 135, 158, 237, 270, 395, 474, 711, 790, 1185, 1422, 2133, 2370, 3555, 4266, 7110, 10665, 21330} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 5 + 6 + 9 + 10 + 15 + 18 + 27 + 30 + 45 + 54 + 79 + 90 + 135 + 158 + 237 + 270 + 395 + 474 + 711 + 790 + 1185 + 1422 + 2133 + 2370 + 3555 + 4266 + 7110 + 10665 + 21330 = 57600.

Nearby Examples

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

Related Operations for 21330

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