Divisors of 11100: All 36 Factors

Quick Answer

11100 has 36 divisors (factors): 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 25, 30, 37, 50, 60, 74, 75, 100, 111, 148, 150, 185, 222, 300, 370, 444, 555, 740, 925, 1110, 1850, 2220, 2775, 3700, 5550, 11100.

Sum: 32984.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 25, 30, 37, 50, 60, 74, 75, 100, 111, 148, 150, 185, 222, 300, 370, 444, 555, 740, 925, 1110, 1850, 2220, 2775, 3700, 5550, 11100

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 11100

The number 11100 has 36 divisors:

1,  2,  3,  4,  5,  6,  10,  12,  15,  20,  25,  30,  37,  50,  60,  74,  75,  100,  111,  148,  150,  185,  222,  300,  370,  444,  555,  740,  925,  1110,  1850,  2220,  2775,  3700,  5550,  11100

Divisor Pairs of 11100

Each pair multiplies to 11100:

Factor 1×Factor 2=Product
1×11100=11100
2×5550=11100
3×3700=11100
4×2775=11100
5×2220=11100
6×1850=11100
10×1110=11100
12×925=11100
15×740=11100
20×555=11100
25×444=11100
30×370=11100
37×300=11100
50×222=11100
60×185=11100
74×150=11100
75×148=11100
100×111=11100

Number of Divisors

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

Sum of Divisors

σ(11100) = 1 + 2 + 3 + 4 + 5 + 6 + 10 + 12 + 15 + 20 + 25 + 30 + 37 + 50 + 60 + 74 + 75 + 100 + 111 + 148 + 150 + 185 + 222 + 300 + 370 + 444 + 555 + 740 + 925 + 1110 + 1850 + 2220 + 2775 + 3700 + 5550 + 11100 = 32984

Properties of 11100

  • 11100 is composite.
  • 11100 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 32984.

Common Divisors with Another Number?

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

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

  1. 1 divides 11100 (11100 ÷ 1 = 11100) → pair (1, 11100)
  2. 2 divides 11100 (11100 ÷ 2 = 5550) → pair (2, 5550)
  3. 3 divides 11100 (11100 ÷ 3 = 3700) → pair (3, 3700)
  4. 4 divides 11100 (11100 ÷ 4 = 2775) → pair (4, 2775)
  5. 5 divides 11100 (11100 ÷ 5 = 2220) → pair (5, 2220)
  6. 6 divides 11100 (11100 ÷ 6 = 1850) → pair (6, 1850)
  7. 10 divides 11100 (11100 ÷ 10 = 1110) → pair (10, 1110)
  8. 12 divides 11100 (11100 ÷ 12 = 925) → pair (12, 925)
  9. 15 divides 11100 (11100 ÷ 15 = 740) → pair (15, 740)
  10. 20 divides 11100 (11100 ÷ 20 = 555) → pair (20, 555)
  11. 25 divides 11100 (11100 ÷ 25 = 444) → pair (25, 444)
  12. 30 divides 11100 (11100 ÷ 30 = 370) → pair (30, 370)
  13. 37 divides 11100 (11100 ÷ 37 = 300) → pair (37, 300)
  14. 50 divides 11100 (11100 ÷ 50 = 222) → pair (50, 222)
  15. 60 divides 11100 (11100 ÷ 60 = 185) → pair (60, 185)
  16. 74 divides 11100 (11100 ÷ 74 = 150) → pair (74, 150)
  17. 75 divides 11100 (11100 ÷ 75 = 148) → pair (75, 148)
  18. 100 divides 11100 (11100 ÷ 100 = 111) → pair (100, 111)
  19. Collect all unique values: {1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 25, 30, 37, 50, 60, 74, 75, 100, 111, 148, 150, 185, 222, 300, 370, 444, 555, 740, 925, 1110, 1850, 2220, 2775, 3700, 5550, 11100} — total 36 divisors.
  20. Sum: 1 + 2 + 3 + 4 + 5 + 6 + 10 + 12 + 15 + 20 + 25 + 30 + 37 + 50 + 60 + 74 + 75 + 100 + 111 + 148 + 150 + 185 + 222 + 300 + 370 + 444 + 555 + 740 + 925 + 1110 + 1850 + 2220 + 2775 + 3700 + 5550 + 11100 = 32984.

Nearby Examples

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

Related Operations for 11100

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