Divisors of 10962: All 32 Factors

Quick Answer

10962 has 32 divisors (factors): 1, 2, 3, 6, 7, 9, 14, 18, 21, 27, 29, 42, 54, 58, 63, 87, 126, 174, 189, 203, 261, 378, 406, 522, 609, 783, 1218, 1566, 1827, 3654, 5481, 10962.

Sum: 28800.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 6, 7, 9, 14, 18, 21, 27, 29, 42, 54, 58, 63, 87, 126, 174, 189, 203, 261, 378, 406, 522, 609, 783, 1218, 1566, 1827, 3654, 5481, 10962

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 10962

The number 10962 has 32 divisors:

1,  2,  3,  6,  7,  9,  14,  18,  21,  27,  29,  42,  54,  58,  63,  87,  126,  174,  189,  203,  261,  378,  406,  522,  609,  783,  1218,  1566,  1827,  3654,  5481,  10962

Divisor Pairs of 10962

Each pair multiplies to 10962:

Factor 1×Factor 2=Product
1×10962=10962
2×5481=10962
3×3654=10962
6×1827=10962
7×1566=10962
9×1218=10962
14×783=10962
18×609=10962
21×522=10962
27×406=10962
29×378=10962
42×261=10962
54×203=10962
58×189=10962
63×174=10962
87×126=10962

Number of Divisors

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

Sum of Divisors

σ(10962) = 1 + 2 + 3 + 6 + 7 + 9 + 14 + 18 + 21 + 27 + 29 + 42 + 54 + 58 + 63 + 87 + 126 + 174 + 189 + 203 + 261 + 378 + 406 + 522 + 609 + 783 + 1218 + 1566 + 1827 + 3654 + 5481 + 10962 = 28800

Properties of 10962

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

Common Divisors with Another Number?

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

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

  1. 1 divides 10962 (10962 ÷ 1 = 10962) → pair (1, 10962)
  2. 2 divides 10962 (10962 ÷ 2 = 5481) → pair (2, 5481)
  3. 3 divides 10962 (10962 ÷ 3 = 3654) → pair (3, 3654)
  4. 6 divides 10962 (10962 ÷ 6 = 1827) → pair (6, 1827)
  5. 7 divides 10962 (10962 ÷ 7 = 1566) → pair (7, 1566)
  6. 9 divides 10962 (10962 ÷ 9 = 1218) → pair (9, 1218)
  7. 14 divides 10962 (10962 ÷ 14 = 783) → pair (14, 783)
  8. 18 divides 10962 (10962 ÷ 18 = 609) → pair (18, 609)
  9. 21 divides 10962 (10962 ÷ 21 = 522) → pair (21, 522)
  10. 27 divides 10962 (10962 ÷ 27 = 406) → pair (27, 406)
  11. 29 divides 10962 (10962 ÷ 29 = 378) → pair (29, 378)
  12. 42 divides 10962 (10962 ÷ 42 = 261) → pair (42, 261)
  13. 54 divides 10962 (10962 ÷ 54 = 203) → pair (54, 203)
  14. 58 divides 10962 (10962 ÷ 58 = 189) → pair (58, 189)
  15. 63 divides 10962 (10962 ÷ 63 = 174) → pair (63, 174)
  16. 87 divides 10962 (10962 ÷ 87 = 126) → pair (87, 126)
  17. Collect all unique values: {1, 2, 3, 6, 7, 9, 14, 18, 21, 27, 29, 42, 54, 58, 63, 87, 126, 174, 189, 203, 261, 378, 406, 522, 609, 783, 1218, 1566, 1827, 3654, 5481, 10962} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 6 + 7 + 9 + 14 + 18 + 21 + 27 + 29 + 42 + 54 + 58 + 63 + 87 + 126 + 174 + 189 + 203 + 261 + 378 + 406 + 522 + 609 + 783 + 1218 + 1566 + 1827 + 3654 + 5481 + 10962 = 28800.

Nearby Examples

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

Related Operations for 10962

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