Divisors of 13300: All 36 Factors

Quick Answer

13300 has 36 divisors (factors): 1, 2, 4, 5, 7, 10, 14, 19, 20, 25, 28, 35, 38, 50, 70, 76, 95, 100, 133, 140, 175, 190, 266, 350, 380, 475, 532, 665, 700, 950, 1330, 1900, 2660, 3325, 6650, 13300.

Sum: 34720.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 4, 5, 7, 10, 14, 19, 20, 25, 28, 35, 38, 50, 70, 76, 95, 100, 133, 140, 175, 190, 266, 350, 380, 475, 532, 665, 700, 950, 1330, 1900, 2660, 3325, 6650, 13300

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 13300

The number 13300 has 36 divisors:

1,  2,  4,  5,  7,  10,  14,  19,  20,  25,  28,  35,  38,  50,  70,  76,  95,  100,  133,  140,  175,  190,  266,  350,  380,  475,  532,  665,  700,  950,  1330,  1900,  2660,  3325,  6650,  13300

Divisor Pairs of 13300

Each pair multiplies to 13300:

Factor 1×Factor 2=Product
1×13300=13300
2×6650=13300
4×3325=13300
5×2660=13300
7×1900=13300
10×1330=13300
14×950=13300
19×700=13300
20×665=13300
25×532=13300
28×475=13300
35×380=13300
38×350=13300
50×266=13300
70×190=13300
76×175=13300
95×140=13300
100×133=13300

Number of Divisors

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

Sum of Divisors

σ(13300) = 1 + 2 + 4 + 5 + 7 + 10 + 14 + 19 + 20 + 25 + 28 + 35 + 38 + 50 + 70 + 76 + 95 + 100 + 133 + 140 + 175 + 190 + 266 + 350 + 380 + 475 + 532 + 665 + 700 + 950 + 1330 + 1900 + 2660 + 3325 + 6650 + 13300 = 34720

Properties of 13300

  • 13300 is composite.
  • 13300 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 34720.

Common Divisors with Another Number?

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

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

  1. 1 divides 13300 (13300 ÷ 1 = 13300) → pair (1, 13300)
  2. 2 divides 13300 (13300 ÷ 2 = 6650) → pair (2, 6650)
  3. 4 divides 13300 (13300 ÷ 4 = 3325) → pair (4, 3325)
  4. 5 divides 13300 (13300 ÷ 5 = 2660) → pair (5, 2660)
  5. 7 divides 13300 (13300 ÷ 7 = 1900) → pair (7, 1900)
  6. 10 divides 13300 (13300 ÷ 10 = 1330) → pair (10, 1330)
  7. 14 divides 13300 (13300 ÷ 14 = 950) → pair (14, 950)
  8. 19 divides 13300 (13300 ÷ 19 = 700) → pair (19, 700)
  9. 20 divides 13300 (13300 ÷ 20 = 665) → pair (20, 665)
  10. 25 divides 13300 (13300 ÷ 25 = 532) → pair (25, 532)
  11. 28 divides 13300 (13300 ÷ 28 = 475) → pair (28, 475)
  12. 35 divides 13300 (13300 ÷ 35 = 380) → pair (35, 380)
  13. 38 divides 13300 (13300 ÷ 38 = 350) → pair (38, 350)
  14. 50 divides 13300 (13300 ÷ 50 = 266) → pair (50, 266)
  15. 70 divides 13300 (13300 ÷ 70 = 190) → pair (70, 190)
  16. 76 divides 13300 (13300 ÷ 76 = 175) → pair (76, 175)
  17. 95 divides 13300 (13300 ÷ 95 = 140) → pair (95, 140)
  18. 100 divides 13300 (13300 ÷ 100 = 133) → pair (100, 133)
  19. Collect all unique values: {1, 2, 4, 5, 7, 10, 14, 19, 20, 25, 28, 35, 38, 50, 70, 76, 95, 100, 133, 140, 175, 190, 266, 350, 380, 475, 532, 665, 700, 950, 1330, 1900, 2660, 3325, 6650, 13300} — total 36 divisors.
  20. Sum: 1 + 2 + 4 + 5 + 7 + 10 + 14 + 19 + 20 + 25 + 28 + 35 + 38 + 50 + 70 + 76 + 95 + 100 + 133 + 140 + 175 + 190 + 266 + 350 + 380 + 475 + 532 + 665 + 700 + 950 + 1330 + 1900 + 2660 + 3325 + 6650 + 13300 = 34720.

Nearby Examples

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

Related Operations for 13300

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