Divisors of 11000: All 32 Factors

Quick Answer

11000 has 32 divisors (factors): 1, 2, 4, 5, 8, 10, 11, 20, 22, 25, 40, 44, 50, 55, 88, 100, 110, 125, 200, 220, 250, 275, 440, 500, 550, 1000, 1100, 1375, 2200, 2750, 5500, 11000.

Sum: 28080.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 4, 5, 8, 10, 11, 20, 22, 25, 40, 44, 50, 55, 88, 100, 110, 125, 200, 220, 250, 275, 440, 500, 550, 1000, 1100, 1375, 2200, 2750, 5500, 11000

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 11000

The number 11000 has 32 divisors:

1,  2,  4,  5,  8,  10,  11,  20,  22,  25,  40,  44,  50,  55,  88,  100,  110,  125,  200,  220,  250,  275,  440,  500,  550,  1000,  1100,  1375,  2200,  2750,  5500,  11000

Divisor Pairs of 11000

Each pair multiplies to 11000:

Factor 1×Factor 2=Product
1×11000=11000
2×5500=11000
4×2750=11000
5×2200=11000
8×1375=11000
10×1100=11000
11×1000=11000
20×550=11000
22×500=11000
25×440=11000
40×275=11000
44×250=11000
50×220=11000
55×200=11000
88×125=11000
100×110=11000

Number of Divisors

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

Sum of Divisors

σ(11000) = 1 + 2 + 4 + 5 + 8 + 10 + 11 + 20 + 22 + 25 + 40 + 44 + 50 + 55 + 88 + 100 + 110 + 125 + 200 + 220 + 250 + 275 + 440 + 500 + 550 + 1000 + 1100 + 1375 + 2200 + 2750 + 5500 + 11000 = 28080

Properties of 11000

  • 11000 is composite.
  • 11000 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 28080.

Common Divisors with Another Number?

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

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

  1. 1 divides 11000 (11000 ÷ 1 = 11000) → pair (1, 11000)
  2. 2 divides 11000 (11000 ÷ 2 = 5500) → pair (2, 5500)
  3. 4 divides 11000 (11000 ÷ 4 = 2750) → pair (4, 2750)
  4. 5 divides 11000 (11000 ÷ 5 = 2200) → pair (5, 2200)
  5. 8 divides 11000 (11000 ÷ 8 = 1375) → pair (8, 1375)
  6. 10 divides 11000 (11000 ÷ 10 = 1100) → pair (10, 1100)
  7. 11 divides 11000 (11000 ÷ 11 = 1000) → pair (11, 1000)
  8. 20 divides 11000 (11000 ÷ 20 = 550) → pair (20, 550)
  9. 22 divides 11000 (11000 ÷ 22 = 500) → pair (22, 500)
  10. 25 divides 11000 (11000 ÷ 25 = 440) → pair (25, 440)
  11. 40 divides 11000 (11000 ÷ 40 = 275) → pair (40, 275)
  12. 44 divides 11000 (11000 ÷ 44 = 250) → pair (44, 250)
  13. 50 divides 11000 (11000 ÷ 50 = 220) → pair (50, 220)
  14. 55 divides 11000 (11000 ÷ 55 = 200) → pair (55, 200)
  15. 88 divides 11000 (11000 ÷ 88 = 125) → pair (88, 125)
  16. 100 divides 11000 (11000 ÷ 100 = 110) → pair (100, 110)
  17. Collect all unique values: {1, 2, 4, 5, 8, 10, 11, 20, 22, 25, 40, 44, 50, 55, 88, 100, 110, 125, 200, 220, 250, 275, 440, 500, 550, 1000, 1100, 1375, 2200, 2750, 5500, 11000} — total 32 divisors.
  18. Sum: 1 + 2 + 4 + 5 + 8 + 10 + 11 + 20 + 22 + 25 + 40 + 44 + 50 + 55 + 88 + 100 + 110 + 125 + 200 + 220 + 250 + 275 + 440 + 500 + 550 + 1000 + 1100 + 1375 + 2200 + 2750 + 5500 + 11000 = 28080.

Nearby Examples

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

Related Operations for 11000

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