Divisors of 10230: All 32 Factors

Quick Answer

10230 has 32 divisors (factors): 1, 2, 3, 5, 6, 10, 11, 15, 22, 30, 31, 33, 55, 62, 66, 93, 110, 155, 165, 186, 310, 330, 341, 465, 682, 930, 1023, 1705, 2046, 3410, 5115, 10230.

Sum: 27648.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 5, 6, 10, 11, 15, 22, 30, 31, 33, 55, 62, 66, 93, 110, 155, 165, 186, 310, 330, 341, 465, 682, 930, 1023, 1705, 2046, 3410, 5115, 10230

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 10230

The number 10230 has 32 divisors:

1,  2,  3,  5,  6,  10,  11,  15,  22,  30,  31,  33,  55,  62,  66,  93,  110,  155,  165,  186,  310,  330,  341,  465,  682,  930,  1023,  1705,  2046,  3410,  5115,  10230

Divisor Pairs of 10230

Each pair multiplies to 10230:

Factor 1×Factor 2=Product
1×10230=10230
2×5115=10230
3×3410=10230
5×2046=10230
6×1705=10230
10×1023=10230
11×930=10230
15×682=10230
22×465=10230
30×341=10230
31×330=10230
33×310=10230
55×186=10230
62×165=10230
66×155=10230
93×110=10230

Number of Divisors

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

Sum of Divisors

σ(10230) = 1 + 2 + 3 + 5 + 6 + 10 + 11 + 15 + 22 + 30 + 31 + 33 + 55 + 62 + 66 + 93 + 110 + 155 + 165 + 186 + 310 + 330 + 341 + 465 + 682 + 930 + 1023 + 1705 + 2046 + 3410 + 5115 + 10230 = 27648

Properties of 10230

  • 10230 is composite.
  • 10230 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 27648.

Common Divisors with Another Number?

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

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

  1. 1 divides 10230 (10230 ÷ 1 = 10230) → pair (1, 10230)
  2. 2 divides 10230 (10230 ÷ 2 = 5115) → pair (2, 5115)
  3. 3 divides 10230 (10230 ÷ 3 = 3410) → pair (3, 3410)
  4. 5 divides 10230 (10230 ÷ 5 = 2046) → pair (5, 2046)
  5. 6 divides 10230 (10230 ÷ 6 = 1705) → pair (6, 1705)
  6. 10 divides 10230 (10230 ÷ 10 = 1023) → pair (10, 1023)
  7. 11 divides 10230 (10230 ÷ 11 = 930) → pair (11, 930)
  8. 15 divides 10230 (10230 ÷ 15 = 682) → pair (15, 682)
  9. 22 divides 10230 (10230 ÷ 22 = 465) → pair (22, 465)
  10. 30 divides 10230 (10230 ÷ 30 = 341) → pair (30, 341)
  11. 31 divides 10230 (10230 ÷ 31 = 330) → pair (31, 330)
  12. 33 divides 10230 (10230 ÷ 33 = 310) → pair (33, 310)
  13. 55 divides 10230 (10230 ÷ 55 = 186) → pair (55, 186)
  14. 62 divides 10230 (10230 ÷ 62 = 165) → pair (62, 165)
  15. 66 divides 10230 (10230 ÷ 66 = 155) → pair (66, 155)
  16. 93 divides 10230 (10230 ÷ 93 = 110) → pair (93, 110)
  17. Collect all unique values: {1, 2, 3, 5, 6, 10, 11, 15, 22, 30, 31, 33, 55, 62, 66, 93, 110, 155, 165, 186, 310, 330, 341, 465, 682, 930, 1023, 1705, 2046, 3410, 5115, 10230} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 5 + 6 + 10 + 11 + 15 + 22 + 30 + 31 + 33 + 55 + 62 + 66 + 93 + 110 + 155 + 165 + 186 + 310 + 330 + 341 + 465 + 682 + 930 + 1023 + 1705 + 2046 + 3410 + 5115 + 10230 = 27648.

Nearby Examples

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

Related Operations for 10230

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