Divisors of 13600: All 36 Factors

Quick Answer

13600 has 36 divisors (factors): 1, 2, 4, 5, 8, 10, 16, 17, 20, 25, 32, 34, 40, 50, 68, 80, 85, 100, 136, 160, 170, 200, 272, 340, 400, 425, 544, 680, 800, 850, 1360, 1700, 2720, 3400, 6800, 13600.

Sum: 35154.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 4, 5, 8, 10, 16, 17, 20, 25, 32, 34, 40, 50, 68, 80, 85, 100, 136, 160, 170, 200, 272, 340, 400, 425, 544, 680, 800, 850, 1360, 1700, 2720, 3400, 6800, 13600

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 13600

The number 13600 has 36 divisors:

1,  2,  4,  5,  8,  10,  16,  17,  20,  25,  32,  34,  40,  50,  68,  80,  85,  100,  136,  160,  170,  200,  272,  340,  400,  425,  544,  680,  800,  850,  1360,  1700,  2720,  3400,  6800,  13600

Divisor Pairs of 13600

Each pair multiplies to 13600:

Factor 1×Factor 2=Product
1×13600=13600
2×6800=13600
4×3400=13600
5×2720=13600
8×1700=13600
10×1360=13600
16×850=13600
17×800=13600
20×680=13600
25×544=13600
32×425=13600
34×400=13600
40×340=13600
50×272=13600
68×200=13600
80×170=13600
85×160=13600
100×136=13600

Number of Divisors

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

Sum of Divisors

σ(13600) = 1 + 2 + 4 + 5 + 8 + 10 + 16 + 17 + 20 + 25 + 32 + 34 + 40 + 50 + 68 + 80 + 85 + 100 + 136 + 160 + 170 + 200 + 272 + 340 + 400 + 425 + 544 + 680 + 800 + 850 + 1360 + 1700 + 2720 + 3400 + 6800 + 13600 = 35154

Properties of 13600

  • 13600 is composite.
  • 13600 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 35154.

Common Divisors with Another Number?

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

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

  1. 1 divides 13600 (13600 ÷ 1 = 13600) → pair (1, 13600)
  2. 2 divides 13600 (13600 ÷ 2 = 6800) → pair (2, 6800)
  3. 4 divides 13600 (13600 ÷ 4 = 3400) → pair (4, 3400)
  4. 5 divides 13600 (13600 ÷ 5 = 2720) → pair (5, 2720)
  5. 8 divides 13600 (13600 ÷ 8 = 1700) → pair (8, 1700)
  6. 10 divides 13600 (13600 ÷ 10 = 1360) → pair (10, 1360)
  7. 16 divides 13600 (13600 ÷ 16 = 850) → pair (16, 850)
  8. 17 divides 13600 (13600 ÷ 17 = 800) → pair (17, 800)
  9. 20 divides 13600 (13600 ÷ 20 = 680) → pair (20, 680)
  10. 25 divides 13600 (13600 ÷ 25 = 544) → pair (25, 544)
  11. 32 divides 13600 (13600 ÷ 32 = 425) → pair (32, 425)
  12. 34 divides 13600 (13600 ÷ 34 = 400) → pair (34, 400)
  13. 40 divides 13600 (13600 ÷ 40 = 340) → pair (40, 340)
  14. 50 divides 13600 (13600 ÷ 50 = 272) → pair (50, 272)
  15. 68 divides 13600 (13600 ÷ 68 = 200) → pair (68, 200)
  16. 80 divides 13600 (13600 ÷ 80 = 170) → pair (80, 170)
  17. 85 divides 13600 (13600 ÷ 85 = 160) → pair (85, 160)
  18. 100 divides 13600 (13600 ÷ 100 = 136) → pair (100, 136)
  19. Collect all unique values: {1, 2, 4, 5, 8, 10, 16, 17, 20, 25, 32, 34, 40, 50, 68, 80, 85, 100, 136, 160, 170, 200, 272, 340, 400, 425, 544, 680, 800, 850, 1360, 1700, 2720, 3400, 6800, 13600} — total 36 divisors.
  20. Sum: 1 + 2 + 4 + 5 + 8 + 10 + 16 + 17 + 20 + 25 + 32 + 34 + 40 + 50 + 68 + 80 + 85 + 100 + 136 + 160 + 170 + 200 + 272 + 340 + 400 + 425 + 544 + 680 + 800 + 850 + 1360 + 1700 + 2720 + 3400 + 6800 + 13600 = 35154.

Nearby Examples

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

Related Operations for 13600

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