Divisors of 6000: All 40 Factors

Quick Answer

6000 has 40 divisors (factors): 1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 24, 25, 30, 40, 48, 50, 60, 75, 80, 100, 120, 125, 150, 200, 240, 250, 300, 375, 400, 500, 600, 750, 1000, 1200, 1500, 2000, 3000, 6000.

Sum: 19344.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
40 divisors
1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 24, 25, 30, 40, 48, 50, 60, 75, 80, 100, 120, 125, 150, 200, 240, 250, 300, 375, 400, 500, 600, 750, 1000, 1200, 1500, 2000, 3000, 6000

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 6000

The number 6000 has 40 divisors:

1,  2,  3,  4,  5,  6,  8,  10,  12,  15,  16,  20,  24,  25,  30,  40,  48,  50,  60,  75,  80,  100,  120,  125,  150,  200,  240,  250,  300,  375,  400,  500,  600,  750,  1000,  1200,  1500,  2000,  3000,  6000

Divisor Pairs of 6000

Each pair multiplies to 6000:

Factor 1×Factor 2=Product
1×6000=6000
2×3000=6000
3×2000=6000
4×1500=6000
5×1200=6000
6×1000=6000
8×750=6000
10×600=6000
12×500=6000
15×400=6000
16×375=6000
20×300=6000
24×250=6000
25×240=6000
30×200=6000
40×150=6000
48×125=6000
50×120=6000
60×100=6000
75×80=6000

Number of Divisors

The number 6000 has 40 divisors, written as τ(6000) = 40 in number theory.

Sum of Divisors

σ(6000) = 1 + 2 + 3 + 4 + 5 + 6 + 8 + 10 + 12 + 15 + 16 + 20 + 24 + 25 + 30 + 40 + 48 + 50 + 60 + 75 + 80 + 100 + 120 + 125 + 150 + 200 + 240 + 250 + 300 + 375 + 400 + 500 + 600 + 750 + 1000 + 1200 + 1500 + 2000 + 3000 + 6000 = 19344

Properties of 6000

  • 6000 is composite.
  • 6000 is not a perfect square.
  • Number of divisors: 40.
  • Sum of divisors: 19344.

Common Divisors with Another Number?

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

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

  1. 1 divides 6000 (6000 ÷ 1 = 6000) → pair (1, 6000)
  2. 2 divides 6000 (6000 ÷ 2 = 3000) → pair (2, 3000)
  3. 3 divides 6000 (6000 ÷ 3 = 2000) → pair (3, 2000)
  4. 4 divides 6000 (6000 ÷ 4 = 1500) → pair (4, 1500)
  5. 5 divides 6000 (6000 ÷ 5 = 1200) → pair (5, 1200)
  6. 6 divides 6000 (6000 ÷ 6 = 1000) → pair (6, 1000)
  7. 8 divides 6000 (6000 ÷ 8 = 750) → pair (8, 750)
  8. 10 divides 6000 (6000 ÷ 10 = 600) → pair (10, 600)
  9. 12 divides 6000 (6000 ÷ 12 = 500) → pair (12, 500)
  10. 15 divides 6000 (6000 ÷ 15 = 400) → pair (15, 400)
  11. 16 divides 6000 (6000 ÷ 16 = 375) → pair (16, 375)
  12. 20 divides 6000 (6000 ÷ 20 = 300) → pair (20, 300)
  13. 24 divides 6000 (6000 ÷ 24 = 250) → pair (24, 250)
  14. 25 divides 6000 (6000 ÷ 25 = 240) → pair (25, 240)
  15. 30 divides 6000 (6000 ÷ 30 = 200) → pair (30, 200)
  16. 40 divides 6000 (6000 ÷ 40 = 150) → pair (40, 150)
  17. 48 divides 6000 (6000 ÷ 48 = 125) → pair (48, 125)
  18. 50 divides 6000 (6000 ÷ 50 = 120) → pair (50, 120)
  19. 60 divides 6000 (6000 ÷ 60 = 100) → pair (60, 100)
  20. 75 divides 6000 (6000 ÷ 75 = 80) → pair (75, 80)
  21. Collect all unique values: {1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 24, 25, 30, 40, 48, 50, 60, 75, 80, 100, 120, 125, 150, 200, 240, 250, 300, 375, 400, 500, 600, 750, 1000, 1200, 1500, 2000, 3000, 6000} — total 40 divisors.
  22. Sum: 1 + 2 + 3 + 4 + 5 + 6 + 8 + 10 + 12 + 15 + 16 + 20 + 24 + 25 + 30 + 40 + 48 + 50 + 60 + 75 + 80 + 100 + 120 + 125 + 150 + 200 + 240 + 250 + 300 + 375 + 400 + 500 + 600 + 750 + 1000 + 1200 + 1500 + 2000 + 3000 + 6000 = 19344.

Nearby Examples

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

Related Operations for 6000

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