Divisors of 10290: All 32 Factors

Quick Answer

10290 has 32 divisors (factors): 1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 49, 70, 98, 105, 147, 210, 245, 294, 343, 490, 686, 735, 1029, 1470, 1715, 2058, 3430, 5145, 10290.

Sum: 28800.

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, 49, 70, 98, 105, 147, 210, 245, 294, 343, 490, 686, 735, 1029, 1470, 1715, 2058, 3430, 5145, 10290

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 10290

The number 10290 has 32 divisors:

1,  2,  3,  5,  6,  7,  10,  14,  15,  21,  30,  35,  42,  49,  70,  98,  105,  147,  210,  245,  294,  343,  490,  686,  735,  1029,  1470,  1715,  2058,  3430,  5145,  10290

Divisor Pairs of 10290

Each pair multiplies to 10290:

Factor 1×Factor 2=Product
1×10290=10290
2×5145=10290
3×3430=10290
5×2058=10290
6×1715=10290
7×1470=10290
10×1029=10290
14×735=10290
15×686=10290
21×490=10290
30×343=10290
35×294=10290
42×245=10290
49×210=10290
70×147=10290
98×105=10290

Number of Divisors

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

Sum of Divisors

σ(10290) = 1 + 2 + 3 + 5 + 6 + 7 + 10 + 14 + 15 + 21 + 30 + 35 + 42 + 49 + 70 + 98 + 105 + 147 + 210 + 245 + 294 + 343 + 490 + 686 + 735 + 1029 + 1470 + 1715 + 2058 + 3430 + 5145 + 10290 = 28800

Properties of 10290

  • 10290 is composite.
  • 10290 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 28800.

Common Divisors with Another Number?

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

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

  1. 1 divides 10290 (10290 ÷ 1 = 10290) → pair (1, 10290)
  2. 2 divides 10290 (10290 ÷ 2 = 5145) → pair (2, 5145)
  3. 3 divides 10290 (10290 ÷ 3 = 3430) → pair (3, 3430)
  4. 5 divides 10290 (10290 ÷ 5 = 2058) → pair (5, 2058)
  5. 6 divides 10290 (10290 ÷ 6 = 1715) → pair (6, 1715)
  6. 7 divides 10290 (10290 ÷ 7 = 1470) → pair (7, 1470)
  7. 10 divides 10290 (10290 ÷ 10 = 1029) → pair (10, 1029)
  8. 14 divides 10290 (10290 ÷ 14 = 735) → pair (14, 735)
  9. 15 divides 10290 (10290 ÷ 15 = 686) → pair (15, 686)
  10. 21 divides 10290 (10290 ÷ 21 = 490) → pair (21, 490)
  11. 30 divides 10290 (10290 ÷ 30 = 343) → pair (30, 343)
  12. 35 divides 10290 (10290 ÷ 35 = 294) → pair (35, 294)
  13. 42 divides 10290 (10290 ÷ 42 = 245) → pair (42, 245)
  14. 49 divides 10290 (10290 ÷ 49 = 210) → pair (49, 210)
  15. 70 divides 10290 (10290 ÷ 70 = 147) → pair (70, 147)
  16. 98 divides 10290 (10290 ÷ 98 = 105) → pair (98, 105)
  17. Collect all unique values: {1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 49, 70, 98, 105, 147, 210, 245, 294, 343, 490, 686, 735, 1029, 1470, 1715, 2058, 3430, 5145, 10290} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 5 + 6 + 7 + 10 + 14 + 15 + 21 + 30 + 35 + 42 + 49 + 70 + 98 + 105 + 147 + 210 + 245 + 294 + 343 + 490 + 686 + 735 + 1029 + 1470 + 1715 + 2058 + 3430 + 5145 + 10290 = 28800.

Nearby Examples

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

Related Operations for 10290

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