Divisors of 40230: All 32 Factors

Quick Answer

40230 has 32 divisors (factors): 1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 90, 135, 149, 270, 298, 447, 745, 894, 1341, 1490, 2235, 2682, 4023, 4470, 6705, 8046, 13410, 20115, 40230.

Sum: 108000.

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, 90, 135, 149, 270, 298, 447, 745, 894, 1341, 1490, 2235, 2682, 4023, 4470, 6705, 8046, 13410, 20115, 40230

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 40230

The number 40230 has 32 divisors:

1,  2,  3,  5,  6,  9,  10,  15,  18,  27,  30,  45,  54,  90,  135,  149,  270,  298,  447,  745,  894,  1341,  1490,  2235,  2682,  4023,  4470,  6705,  8046,  13410,  20115,  40230

Divisor Pairs of 40230

Each pair multiplies to 40230:

Factor 1×Factor 2=Product
1×40230=40230
2×20115=40230
3×13410=40230
5×8046=40230
6×6705=40230
9×4470=40230
10×4023=40230
15×2682=40230
18×2235=40230
27×1490=40230
30×1341=40230
45×894=40230
54×745=40230
90×447=40230
135×298=40230
149×270=40230

Number of Divisors

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

Sum of Divisors

σ(40230) = 1 + 2 + 3 + 5 + 6 + 9 + 10 + 15 + 18 + 27 + 30 + 45 + 54 + 90 + 135 + 149 + 270 + 298 + 447 + 745 + 894 + 1341 + 1490 + 2235 + 2682 + 4023 + 4470 + 6705 + 8046 + 13410 + 20115 + 40230 = 108000

Properties of 40230

  • 40230 is composite.
  • 40230 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 108000.

Common Divisors with Another Number?

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

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

  1. 1 divides 40230 (40230 ÷ 1 = 40230) → pair (1, 40230)
  2. 2 divides 40230 (40230 ÷ 2 = 20115) → pair (2, 20115)
  3. 3 divides 40230 (40230 ÷ 3 = 13410) → pair (3, 13410)
  4. 5 divides 40230 (40230 ÷ 5 = 8046) → pair (5, 8046)
  5. 6 divides 40230 (40230 ÷ 6 = 6705) → pair (6, 6705)
  6. 9 divides 40230 (40230 ÷ 9 = 4470) → pair (9, 4470)
  7. 10 divides 40230 (40230 ÷ 10 = 4023) → pair (10, 4023)
  8. 15 divides 40230 (40230 ÷ 15 = 2682) → pair (15, 2682)
  9. 18 divides 40230 (40230 ÷ 18 = 2235) → pair (18, 2235)
  10. 27 divides 40230 (40230 ÷ 27 = 1490) → pair (27, 1490)
  11. 30 divides 40230 (40230 ÷ 30 = 1341) → pair (30, 1341)
  12. 45 divides 40230 (40230 ÷ 45 = 894) → pair (45, 894)
  13. 54 divides 40230 (40230 ÷ 54 = 745) → pair (54, 745)
  14. 90 divides 40230 (40230 ÷ 90 = 447) → pair (90, 447)
  15. 135 divides 40230 (40230 ÷ 135 = 298) → pair (135, 298)
  16. 149 divides 40230 (40230 ÷ 149 = 270) → pair (149, 270)
  17. Collect all unique values: {1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 90, 135, 149, 270, 298, 447, 745, 894, 1341, 1490, 2235, 2682, 4023, 4470, 6705, 8046, 13410, 20115, 40230} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 5 + 6 + 9 + 10 + 15 + 18 + 27 + 30 + 45 + 54 + 90 + 135 + 149 + 270 + 298 + 447 + 745 + 894 + 1341 + 1490 + 2235 + 2682 + 4023 + 4470 + 6705 + 8046 + 13410 + 20115 + 40230 = 108000.

Nearby Examples

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

Related Operations for 40230

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