Divisors of 24030: All 32 Factors

Quick Answer

24030 has 32 divisors (factors): 1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 89, 90, 135, 178, 267, 270, 445, 534, 801, 890, 1335, 1602, 2403, 2670, 4005, 4806, 8010, 12015, 24030.

Sum: 64800.

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, 89, 90, 135, 178, 267, 270, 445, 534, 801, 890, 1335, 1602, 2403, 2670, 4005, 4806, 8010, 12015, 24030

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 24030

The number 24030 has 32 divisors:

1,  2,  3,  5,  6,  9,  10,  15,  18,  27,  30,  45,  54,  89,  90,  135,  178,  267,  270,  445,  534,  801,  890,  1335,  1602,  2403,  2670,  4005,  4806,  8010,  12015,  24030

Divisor Pairs of 24030

Each pair multiplies to 24030:

Factor 1×Factor 2=Product
1×24030=24030
2×12015=24030
3×8010=24030
5×4806=24030
6×4005=24030
9×2670=24030
10×2403=24030
15×1602=24030
18×1335=24030
27×890=24030
30×801=24030
45×534=24030
54×445=24030
89×270=24030
90×267=24030
135×178=24030

Number of Divisors

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

Sum of Divisors

σ(24030) = 1 + 2 + 3 + 5 + 6 + 9 + 10 + 15 + 18 + 27 + 30 + 45 + 54 + 89 + 90 + 135 + 178 + 267 + 270 + 445 + 534 + 801 + 890 + 1335 + 1602 + 2403 + 2670 + 4005 + 4806 + 8010 + 12015 + 24030 = 64800

Properties of 24030

  • 24030 is composite.
  • 24030 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 64800.

Common Divisors with Another Number?

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

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

  1. 1 divides 24030 (24030 ÷ 1 = 24030) → pair (1, 24030)
  2. 2 divides 24030 (24030 ÷ 2 = 12015) → pair (2, 12015)
  3. 3 divides 24030 (24030 ÷ 3 = 8010) → pair (3, 8010)
  4. 5 divides 24030 (24030 ÷ 5 = 4806) → pair (5, 4806)
  5. 6 divides 24030 (24030 ÷ 6 = 4005) → pair (6, 4005)
  6. 9 divides 24030 (24030 ÷ 9 = 2670) → pair (9, 2670)
  7. 10 divides 24030 (24030 ÷ 10 = 2403) → pair (10, 2403)
  8. 15 divides 24030 (24030 ÷ 15 = 1602) → pair (15, 1602)
  9. 18 divides 24030 (24030 ÷ 18 = 1335) → pair (18, 1335)
  10. 27 divides 24030 (24030 ÷ 27 = 890) → pair (27, 890)
  11. 30 divides 24030 (24030 ÷ 30 = 801) → pair (30, 801)
  12. 45 divides 24030 (24030 ÷ 45 = 534) → pair (45, 534)
  13. 54 divides 24030 (24030 ÷ 54 = 445) → pair (54, 445)
  14. 89 divides 24030 (24030 ÷ 89 = 270) → pair (89, 270)
  15. 90 divides 24030 (24030 ÷ 90 = 267) → pair (90, 267)
  16. 135 divides 24030 (24030 ÷ 135 = 178) → pair (135, 178)
  17. Collect all unique values: {1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 89, 90, 135, 178, 267, 270, 445, 534, 801, 890, 1335, 1602, 2403, 2670, 4005, 4806, 8010, 12015, 24030} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 5 + 6 + 9 + 10 + 15 + 18 + 27 + 30 + 45 + 54 + 89 + 90 + 135 + 178 + 267 + 270 + 445 + 534 + 801 + 890 + 1335 + 1602 + 2403 + 2670 + 4005 + 4806 + 8010 + 12015 + 24030 = 64800.

Nearby Examples

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

Related Operations for 24030

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