Divisors of 15200: All 36 Factors

Quick Answer

15200 has 36 divisors (factors): 1, 2, 4, 5, 8, 10, 16, 19, 20, 25, 32, 38, 40, 50, 76, 80, 95, 100, 152, 160, 190, 200, 304, 380, 400, 475, 608, 760, 800, 950, 1520, 1900, 3040, 3800, 7600, 15200.

Sum: 39060.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 4, 5, 8, 10, 16, 19, 20, 25, 32, 38, 40, 50, 76, 80, 95, 100, 152, 160, 190, 200, 304, 380, 400, 475, 608, 760, 800, 950, 1520, 1900, 3040, 3800, 7600, 15200

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 15200

The number 15200 has 36 divisors:

1,  2,  4,  5,  8,  10,  16,  19,  20,  25,  32,  38,  40,  50,  76,  80,  95,  100,  152,  160,  190,  200,  304,  380,  400,  475,  608,  760,  800,  950,  1520,  1900,  3040,  3800,  7600,  15200

Divisor Pairs of 15200

Each pair multiplies to 15200:

Factor 1×Factor 2=Product
1×15200=15200
2×7600=15200
4×3800=15200
5×3040=15200
8×1900=15200
10×1520=15200
16×950=15200
19×800=15200
20×760=15200
25×608=15200
32×475=15200
38×400=15200
40×380=15200
50×304=15200
76×200=15200
80×190=15200
95×160=15200
100×152=15200

Number of Divisors

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

Sum of Divisors

σ(15200) = 1 + 2 + 4 + 5 + 8 + 10 + 16 + 19 + 20 + 25 + 32 + 38 + 40 + 50 + 76 + 80 + 95 + 100 + 152 + 160 + 190 + 200 + 304 + 380 + 400 + 475 + 608 + 760 + 800 + 950 + 1520 + 1900 + 3040 + 3800 + 7600 + 15200 = 39060

Properties of 15200

  • 15200 is composite.
  • 15200 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 39060.

Common Divisors with Another Number?

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

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

  1. 1 divides 15200 (15200 ÷ 1 = 15200) → pair (1, 15200)
  2. 2 divides 15200 (15200 ÷ 2 = 7600) → pair (2, 7600)
  3. 4 divides 15200 (15200 ÷ 4 = 3800) → pair (4, 3800)
  4. 5 divides 15200 (15200 ÷ 5 = 3040) → pair (5, 3040)
  5. 8 divides 15200 (15200 ÷ 8 = 1900) → pair (8, 1900)
  6. 10 divides 15200 (15200 ÷ 10 = 1520) → pair (10, 1520)
  7. 16 divides 15200 (15200 ÷ 16 = 950) → pair (16, 950)
  8. 19 divides 15200 (15200 ÷ 19 = 800) → pair (19, 800)
  9. 20 divides 15200 (15200 ÷ 20 = 760) → pair (20, 760)
  10. 25 divides 15200 (15200 ÷ 25 = 608) → pair (25, 608)
  11. 32 divides 15200 (15200 ÷ 32 = 475) → pair (32, 475)
  12. 38 divides 15200 (15200 ÷ 38 = 400) → pair (38, 400)
  13. 40 divides 15200 (15200 ÷ 40 = 380) → pair (40, 380)
  14. 50 divides 15200 (15200 ÷ 50 = 304) → pair (50, 304)
  15. 76 divides 15200 (15200 ÷ 76 = 200) → pair (76, 200)
  16. 80 divides 15200 (15200 ÷ 80 = 190) → pair (80, 190)
  17. 95 divides 15200 (15200 ÷ 95 = 160) → pair (95, 160)
  18. 100 divides 15200 (15200 ÷ 100 = 152) → pair (100, 152)
  19. Collect all unique values: {1, 2, 4, 5, 8, 10, 16, 19, 20, 25, 32, 38, 40, 50, 76, 80, 95, 100, 152, 160, 190, 200, 304, 380, 400, 475, 608, 760, 800, 950, 1520, 1900, 3040, 3800, 7600, 15200} — total 36 divisors.
  20. Sum: 1 + 2 + 4 + 5 + 8 + 10 + 16 + 19 + 20 + 25 + 32 + 38 + 40 + 50 + 76 + 80 + 95 + 100 + 152 + 160 + 190 + 200 + 304 + 380 + 400 + 475 + 608 + 760 + 800 + 950 + 1520 + 1900 + 3040 + 3800 + 7600 + 15200 = 39060.

Nearby Examples

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

Related Operations for 15200

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