Divisors of 11900: All 36 Factors

Quick Answer

11900 has 36 divisors (factors): 1, 2, 4, 5, 7, 10, 14, 17, 20, 25, 28, 34, 35, 50, 68, 70, 85, 100, 119, 140, 170, 175, 238, 340, 350, 425, 476, 595, 700, 850, 1190, 1700, 2380, 2975, 5950, 11900.

Sum: 31248.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 4, 5, 7, 10, 14, 17, 20, 25, 28, 34, 35, 50, 68, 70, 85, 100, 119, 140, 170, 175, 238, 340, 350, 425, 476, 595, 700, 850, 1190, 1700, 2380, 2975, 5950, 11900

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 11900

The number 11900 has 36 divisors:

1,  2,  4,  5,  7,  10,  14,  17,  20,  25,  28,  34,  35,  50,  68,  70,  85,  100,  119,  140,  170,  175,  238,  340,  350,  425,  476,  595,  700,  850,  1190,  1700,  2380,  2975,  5950,  11900

Divisor Pairs of 11900

Each pair multiplies to 11900:

Factor 1×Factor 2=Product
1×11900=11900
2×5950=11900
4×2975=11900
5×2380=11900
7×1700=11900
10×1190=11900
14×850=11900
17×700=11900
20×595=11900
25×476=11900
28×425=11900
34×350=11900
35×340=11900
50×238=11900
68×175=11900
70×170=11900
85×140=11900
100×119=11900

Number of Divisors

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

Sum of Divisors

σ(11900) = 1 + 2 + 4 + 5 + 7 + 10 + 14 + 17 + 20 + 25 + 28 + 34 + 35 + 50 + 68 + 70 + 85 + 100 + 119 + 140 + 170 + 175 + 238 + 340 + 350 + 425 + 476 + 595 + 700 + 850 + 1190 + 1700 + 2380 + 2975 + 5950 + 11900 = 31248

Properties of 11900

  • 11900 is composite.
  • 11900 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 31248.

Common Divisors with Another Number?

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

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

  1. 1 divides 11900 (11900 ÷ 1 = 11900) → pair (1, 11900)
  2. 2 divides 11900 (11900 ÷ 2 = 5950) → pair (2, 5950)
  3. 4 divides 11900 (11900 ÷ 4 = 2975) → pair (4, 2975)
  4. 5 divides 11900 (11900 ÷ 5 = 2380) → pair (5, 2380)
  5. 7 divides 11900 (11900 ÷ 7 = 1700) → pair (7, 1700)
  6. 10 divides 11900 (11900 ÷ 10 = 1190) → pair (10, 1190)
  7. 14 divides 11900 (11900 ÷ 14 = 850) → pair (14, 850)
  8. 17 divides 11900 (11900 ÷ 17 = 700) → pair (17, 700)
  9. 20 divides 11900 (11900 ÷ 20 = 595) → pair (20, 595)
  10. 25 divides 11900 (11900 ÷ 25 = 476) → pair (25, 476)
  11. 28 divides 11900 (11900 ÷ 28 = 425) → pair (28, 425)
  12. 34 divides 11900 (11900 ÷ 34 = 350) → pair (34, 350)
  13. 35 divides 11900 (11900 ÷ 35 = 340) → pair (35, 340)
  14. 50 divides 11900 (11900 ÷ 50 = 238) → pair (50, 238)
  15. 68 divides 11900 (11900 ÷ 68 = 175) → pair (68, 175)
  16. 70 divides 11900 (11900 ÷ 70 = 170) → pair (70, 170)
  17. 85 divides 11900 (11900 ÷ 85 = 140) → pair (85, 140)
  18. 100 divides 11900 (11900 ÷ 100 = 119) → pair (100, 119)
  19. Collect all unique values: {1, 2, 4, 5, 7, 10, 14, 17, 20, 25, 28, 34, 35, 50, 68, 70, 85, 100, 119, 140, 170, 175, 238, 340, 350, 425, 476, 595, 700, 850, 1190, 1700, 2380, 2975, 5950, 11900} — total 36 divisors.
  20. Sum: 1 + 2 + 4 + 5 + 7 + 10 + 14 + 17 + 20 + 25 + 28 + 34 + 35 + 50 + 68 + 70 + 85 + 100 + 119 + 140 + 170 + 175 + 238 + 340 + 350 + 425 + 476 + 595 + 700 + 850 + 1190 + 1700 + 2380 + 2975 + 5950 + 11900 = 31248.

Nearby Examples

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

Related Operations for 11900

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