Divisors of 16940: All 36 Factors

Quick Answer

16940 has 36 divisors (factors): 1, 2, 4, 5, 7, 10, 11, 14, 20, 22, 28, 35, 44, 55, 70, 77, 110, 121, 140, 154, 220, 242, 308, 385, 484, 605, 770, 847, 1210, 1540, 1694, 2420, 3388, 4235, 8470, 16940.

Sum: 44688.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 4, 5, 7, 10, 11, 14, 20, 22, 28, 35, 44, 55, 70, 77, 110, 121, 140, 154, 220, 242, 308, 385, 484, 605, 770, 847, 1210, 1540, 1694, 2420, 3388, 4235, 8470, 16940

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 16940

The number 16940 has 36 divisors:

1,  2,  4,  5,  7,  10,  11,  14,  20,  22,  28,  35,  44,  55,  70,  77,  110,  121,  140,  154,  220,  242,  308,  385,  484,  605,  770,  847,  1210,  1540,  1694,  2420,  3388,  4235,  8470,  16940

Divisor Pairs of 16940

Each pair multiplies to 16940:

Factor 1×Factor 2=Product
1×16940=16940
2×8470=16940
4×4235=16940
5×3388=16940
7×2420=16940
10×1694=16940
11×1540=16940
14×1210=16940
20×847=16940
22×770=16940
28×605=16940
35×484=16940
44×385=16940
55×308=16940
70×242=16940
77×220=16940
110×154=16940
121×140=16940

Number of Divisors

The number 16940 has 36 divisors, written as τ(16940) = 36 in number theory.

Sum of Divisors

σ(16940) = 1 + 2 + 4 + 5 + 7 + 10 + 11 + 14 + 20 + 22 + 28 + 35 + 44 + 55 + 70 + 77 + 110 + 121 + 140 + 154 + 220 + 242 + 308 + 385 + 484 + 605 + 770 + 847 + 1210 + 1540 + 1694 + 2420 + 3388 + 4235 + 8470 + 16940 = 44688

Properties of 16940

  • 16940 is composite.
  • 16940 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 44688.

Common Divisors with Another Number?

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

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

  1. 1 divides 16940 (16940 ÷ 1 = 16940) → pair (1, 16940)
  2. 2 divides 16940 (16940 ÷ 2 = 8470) → pair (2, 8470)
  3. 4 divides 16940 (16940 ÷ 4 = 4235) → pair (4, 4235)
  4. 5 divides 16940 (16940 ÷ 5 = 3388) → pair (5, 3388)
  5. 7 divides 16940 (16940 ÷ 7 = 2420) → pair (7, 2420)
  6. 10 divides 16940 (16940 ÷ 10 = 1694) → pair (10, 1694)
  7. 11 divides 16940 (16940 ÷ 11 = 1540) → pair (11, 1540)
  8. 14 divides 16940 (16940 ÷ 14 = 1210) → pair (14, 1210)
  9. 20 divides 16940 (16940 ÷ 20 = 847) → pair (20, 847)
  10. 22 divides 16940 (16940 ÷ 22 = 770) → pair (22, 770)
  11. 28 divides 16940 (16940 ÷ 28 = 605) → pair (28, 605)
  12. 35 divides 16940 (16940 ÷ 35 = 484) → pair (35, 484)
  13. 44 divides 16940 (16940 ÷ 44 = 385) → pair (44, 385)
  14. 55 divides 16940 (16940 ÷ 55 = 308) → pair (55, 308)
  15. 70 divides 16940 (16940 ÷ 70 = 242) → pair (70, 242)
  16. 77 divides 16940 (16940 ÷ 77 = 220) → pair (77, 220)
  17. 110 divides 16940 (16940 ÷ 110 = 154) → pair (110, 154)
  18. 121 divides 16940 (16940 ÷ 121 = 140) → pair (121, 140)
  19. Collect all unique values: {1, 2, 4, 5, 7, 10, 11, 14, 20, 22, 28, 35, 44, 55, 70, 77, 110, 121, 140, 154, 220, 242, 308, 385, 484, 605, 770, 847, 1210, 1540, 1694, 2420, 3388, 4235, 8470, 16940} — total 36 divisors.
  20. Sum: 1 + 2 + 4 + 5 + 7 + 10 + 11 + 14 + 20 + 22 + 28 + 35 + 44 + 55 + 70 + 77 + 110 + 121 + 140 + 154 + 220 + 242 + 308 + 385 + 484 + 605 + 770 + 847 + 1210 + 1540 + 1694 + 2420 + 3388 + 4235 + 8470 + 16940 = 44688.

Nearby Examples

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

Related Operations for 16940

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