Divisors of 16640: All 36 Factors

Quick Answer

16640 has 36 divisors (factors): 1, 2, 4, 5, 8, 10, 13, 16, 20, 26, 32, 40, 52, 64, 65, 80, 104, 128, 130, 160, 208, 256, 260, 320, 416, 520, 640, 832, 1040, 1280, 1664, 2080, 3328, 4160, 8320, 16640.

Sum: 42924.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 4, 5, 8, 10, 13, 16, 20, 26, 32, 40, 52, 64, 65, 80, 104, 128, 130, 160, 208, 256, 260, 320, 416, 520, 640, 832, 1040, 1280, 1664, 2080, 3328, 4160, 8320, 16640

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 16640

The number 16640 has 36 divisors:

1,  2,  4,  5,  8,  10,  13,  16,  20,  26,  32,  40,  52,  64,  65,  80,  104,  128,  130,  160,  208,  256,  260,  320,  416,  520,  640,  832,  1040,  1280,  1664,  2080,  3328,  4160,  8320,  16640

Divisor Pairs of 16640

Each pair multiplies to 16640:

Factor 1×Factor 2=Product
1×16640=16640
2×8320=16640
4×4160=16640
5×3328=16640
8×2080=16640
10×1664=16640
13×1280=16640
16×1040=16640
20×832=16640
26×640=16640
32×520=16640
40×416=16640
52×320=16640
64×260=16640
65×256=16640
80×208=16640
104×160=16640
128×130=16640

Number of Divisors

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

Sum of Divisors

σ(16640) = 1 + 2 + 4 + 5 + 8 + 10 + 13 + 16 + 20 + 26 + 32 + 40 + 52 + 64 + 65 + 80 + 104 + 128 + 130 + 160 + 208 + 256 + 260 + 320 + 416 + 520 + 640 + 832 + 1040 + 1280 + 1664 + 2080 + 3328 + 4160 + 8320 + 16640 = 42924

Properties of 16640

  • 16640 is composite.
  • 16640 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 42924.

Common Divisors with Another Number?

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

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

  1. 1 divides 16640 (16640 ÷ 1 = 16640) → pair (1, 16640)
  2. 2 divides 16640 (16640 ÷ 2 = 8320) → pair (2, 8320)
  3. 4 divides 16640 (16640 ÷ 4 = 4160) → pair (4, 4160)
  4. 5 divides 16640 (16640 ÷ 5 = 3328) → pair (5, 3328)
  5. 8 divides 16640 (16640 ÷ 8 = 2080) → pair (8, 2080)
  6. 10 divides 16640 (16640 ÷ 10 = 1664) → pair (10, 1664)
  7. 13 divides 16640 (16640 ÷ 13 = 1280) → pair (13, 1280)
  8. 16 divides 16640 (16640 ÷ 16 = 1040) → pair (16, 1040)
  9. 20 divides 16640 (16640 ÷ 20 = 832) → pair (20, 832)
  10. 26 divides 16640 (16640 ÷ 26 = 640) → pair (26, 640)
  11. 32 divides 16640 (16640 ÷ 32 = 520) → pair (32, 520)
  12. 40 divides 16640 (16640 ÷ 40 = 416) → pair (40, 416)
  13. 52 divides 16640 (16640 ÷ 52 = 320) → pair (52, 320)
  14. 64 divides 16640 (16640 ÷ 64 = 260) → pair (64, 260)
  15. 65 divides 16640 (16640 ÷ 65 = 256) → pair (65, 256)
  16. 80 divides 16640 (16640 ÷ 80 = 208) → pair (80, 208)
  17. 104 divides 16640 (16640 ÷ 104 = 160) → pair (104, 160)
  18. 128 divides 16640 (16640 ÷ 128 = 130) → pair (128, 130)
  19. Collect all unique values: {1, 2, 4, 5, 8, 10, 13, 16, 20, 26, 32, 40, 52, 64, 65, 80, 104, 128, 130, 160, 208, 256, 260, 320, 416, 520, 640, 832, 1040, 1280, 1664, 2080, 3328, 4160, 8320, 16640} — total 36 divisors.
  20. Sum: 1 + 2 + 4 + 5 + 8 + 10 + 13 + 16 + 20 + 26 + 32 + 40 + 52 + 64 + 65 + 80 + 104 + 128 + 130 + 160 + 208 + 256 + 260 + 320 + 416 + 520 + 640 + 832 + 1040 + 1280 + 1664 + 2080 + 3328 + 4160 + 8320 + 16640 = 42924.

Nearby Examples

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

Related Operations for 16640

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