Divisors of 10395: All 32 Factors

Quick Answer

10395 has 32 divisors (factors): 1, 3, 5, 7, 9, 11, 15, 21, 27, 33, 35, 45, 55, 63, 77, 99, 105, 135, 165, 189, 231, 297, 315, 385, 495, 693, 945, 1155, 1485, 2079, 3465, 10395.

Sum: 23040.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 3, 5, 7, 9, 11, 15, 21, 27, 33, 35, 45, 55, 63, 77, 99, 105, 135, 165, 189, 231, 297, 315, 385, 495, 693, 945, 1155, 1485, 2079, 3465, 10395

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 10395

The number 10395 has 32 divisors:

1,  3,  5,  7,  9,  11,  15,  21,  27,  33,  35,  45,  55,  63,  77,  99,  105,  135,  165,  189,  231,  297,  315,  385,  495,  693,  945,  1155,  1485,  2079,  3465,  10395

Divisor Pairs of 10395

Each pair multiplies to 10395:

Factor 1×Factor 2=Product
1×10395=10395
3×3465=10395
5×2079=10395
7×1485=10395
9×1155=10395
11×945=10395
15×693=10395
21×495=10395
27×385=10395
33×315=10395
35×297=10395
45×231=10395
55×189=10395
63×165=10395
77×135=10395
99×105=10395

Number of Divisors

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

Sum of Divisors

σ(10395) = 1 + 3 + 5 + 7 + 9 + 11 + 15 + 21 + 27 + 33 + 35 + 45 + 55 + 63 + 77 + 99 + 105 + 135 + 165 + 189 + 231 + 297 + 315 + 385 + 495 + 693 + 945 + 1155 + 1485 + 2079 + 3465 + 10395 = 23040

Properties of 10395

  • 10395 is composite.
  • 10395 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 23040.

Common Divisors with Another Number?

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

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

  1. 1 divides 10395 (10395 ÷ 1 = 10395) → pair (1, 10395)
  2. 3 divides 10395 (10395 ÷ 3 = 3465) → pair (3, 3465)
  3. 5 divides 10395 (10395 ÷ 5 = 2079) → pair (5, 2079)
  4. 7 divides 10395 (10395 ÷ 7 = 1485) → pair (7, 1485)
  5. 9 divides 10395 (10395 ÷ 9 = 1155) → pair (9, 1155)
  6. 11 divides 10395 (10395 ÷ 11 = 945) → pair (11, 945)
  7. 15 divides 10395 (10395 ÷ 15 = 693) → pair (15, 693)
  8. 21 divides 10395 (10395 ÷ 21 = 495) → pair (21, 495)
  9. 27 divides 10395 (10395 ÷ 27 = 385) → pair (27, 385)
  10. 33 divides 10395 (10395 ÷ 33 = 315) → pair (33, 315)
  11. 35 divides 10395 (10395 ÷ 35 = 297) → pair (35, 297)
  12. 45 divides 10395 (10395 ÷ 45 = 231) → pair (45, 231)
  13. 55 divides 10395 (10395 ÷ 55 = 189) → pair (55, 189)
  14. 63 divides 10395 (10395 ÷ 63 = 165) → pair (63, 165)
  15. 77 divides 10395 (10395 ÷ 77 = 135) → pair (77, 135)
  16. 99 divides 10395 (10395 ÷ 99 = 105) → pair (99, 105)
  17. Collect all unique values: {1, 3, 5, 7, 9, 11, 15, 21, 27, 33, 35, 45, 55, 63, 77, 99, 105, 135, 165, 189, 231, 297, 315, 385, 495, 693, 945, 1155, 1485, 2079, 3465, 10395} — total 32 divisors.
  18. Sum: 1 + 3 + 5 + 7 + 9 + 11 + 15 + 21 + 27 + 33 + 35 + 45 + 55 + 63 + 77 + 99 + 105 + 135 + 165 + 189 + 231 + 297 + 315 + 385 + 495 + 693 + 945 + 1155 + 1485 + 2079 + 3465 + 10395 = 23040.

Nearby Examples

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

Related Operations for 10395

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