Divisors of 32000: All 36 Factors

Quick Answer

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

Sum: 79716.

Divisors (Factors) Calculator


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

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 32000

The number 32000 has 36 divisors:

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

Divisor Pairs of 32000

Each pair multiplies to 32000:

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

Number of Divisors

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

Sum of Divisors

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

Properties of 32000

  • 32000 is composite.
  • 32000 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 79716.

Common Divisors with Another Number?

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

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

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

Nearby Examples

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

Related Operations for 32000

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