Divisors of 16000: All 32 Factors

Quick Answer

16000 has 32 divisors (factors): 1, 2, 4, 5, 8, 10, 16, 20, 25, 32, 40, 50, 64, 80, 100, 125, 128, 160, 200, 250, 320, 400, 500, 640, 800, 1000, 1600, 2000, 3200, 4000, 8000, 16000.

Sum: 39780.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 4, 5, 8, 10, 16, 20, 25, 32, 40, 50, 64, 80, 100, 125, 128, 160, 200, 250, 320, 400, 500, 640, 800, 1000, 1600, 2000, 3200, 4000, 8000, 16000

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 16000

The number 16000 has 32 divisors:

1,  2,  4,  5,  8,  10,  16,  20,  25,  32,  40,  50,  64,  80,  100,  125,  128,  160,  200,  250,  320,  400,  500,  640,  800,  1000,  1600,  2000,  3200,  4000,  8000,  16000

Divisor Pairs of 16000

Each pair multiplies to 16000:

Factor 1×Factor 2=Product
1×16000=16000
2×8000=16000
4×4000=16000
5×3200=16000
8×2000=16000
10×1600=16000
16×1000=16000
20×800=16000
25×640=16000
32×500=16000
40×400=16000
50×320=16000
64×250=16000
80×200=16000
100×160=16000
125×128=16000

Number of Divisors

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

Sum of Divisors

σ(16000) = 1 + 2 + 4 + 5 + 8 + 10 + 16 + 20 + 25 + 32 + 40 + 50 + 64 + 80 + 100 + 125 + 128 + 160 + 200 + 250 + 320 + 400 + 500 + 640 + 800 + 1000 + 1600 + 2000 + 3200 + 4000 + 8000 + 16000 = 39780

Properties of 16000

  • 16000 is composite.
  • 16000 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 39780.

Common Divisors with Another Number?

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

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

  1. 1 divides 16000 (16000 ÷ 1 = 16000) → pair (1, 16000)
  2. 2 divides 16000 (16000 ÷ 2 = 8000) → pair (2, 8000)
  3. 4 divides 16000 (16000 ÷ 4 = 4000) → pair (4, 4000)
  4. 5 divides 16000 (16000 ÷ 5 = 3200) → pair (5, 3200)
  5. 8 divides 16000 (16000 ÷ 8 = 2000) → pair (8, 2000)
  6. 10 divides 16000 (16000 ÷ 10 = 1600) → pair (10, 1600)
  7. 16 divides 16000 (16000 ÷ 16 = 1000) → pair (16, 1000)
  8. 20 divides 16000 (16000 ÷ 20 = 800) → pair (20, 800)
  9. 25 divides 16000 (16000 ÷ 25 = 640) → pair (25, 640)
  10. 32 divides 16000 (16000 ÷ 32 = 500) → pair (32, 500)
  11. 40 divides 16000 (16000 ÷ 40 = 400) → pair (40, 400)
  12. 50 divides 16000 (16000 ÷ 50 = 320) → pair (50, 320)
  13. 64 divides 16000 (16000 ÷ 64 = 250) → pair (64, 250)
  14. 80 divides 16000 (16000 ÷ 80 = 200) → pair (80, 200)
  15. 100 divides 16000 (16000 ÷ 100 = 160) → pair (100, 160)
  16. 125 divides 16000 (16000 ÷ 125 = 128) → pair (125, 128)
  17. Collect all unique values: {1, 2, 4, 5, 8, 10, 16, 20, 25, 32, 40, 50, 64, 80, 100, 125, 128, 160, 200, 250, 320, 400, 500, 640, 800, 1000, 1600, 2000, 3200, 4000, 8000, 16000} — total 32 divisors.
  18. Sum: 1 + 2 + 4 + 5 + 8 + 10 + 16 + 20 + 25 + 32 + 40 + 50 + 64 + 80 + 100 + 125 + 128 + 160 + 200 + 250 + 320 + 400 + 500 + 640 + 800 + 1000 + 1600 + 2000 + 3200 + 4000 + 8000 + 16000 = 39780.

Nearby Examples

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

Related Operations for 16000

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