Divisors of 13000: All 32 Factors

Quick Answer

13000 has 32 divisors (factors): 1, 2, 4, 5, 8, 10, 13, 20, 25, 26, 40, 50, 52, 65, 100, 104, 125, 130, 200, 250, 260, 325, 500, 520, 650, 1000, 1300, 1625, 2600, 3250, 6500, 13000.

Sum: 32760.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 4, 5, 8, 10, 13, 20, 25, 26, 40, 50, 52, 65, 100, 104, 125, 130, 200, 250, 260, 325, 500, 520, 650, 1000, 1300, 1625, 2600, 3250, 6500, 13000

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 13000

The number 13000 has 32 divisors:

1,  2,  4,  5,  8,  10,  13,  20,  25,  26,  40,  50,  52,  65,  100,  104,  125,  130,  200,  250,  260,  325,  500,  520,  650,  1000,  1300,  1625,  2600,  3250,  6500,  13000

Divisor Pairs of 13000

Each pair multiplies to 13000:

Factor 1×Factor 2=Product
1×13000=13000
2×6500=13000
4×3250=13000
5×2600=13000
8×1625=13000
10×1300=13000
13×1000=13000
20×650=13000
25×520=13000
26×500=13000
40×325=13000
50×260=13000
52×250=13000
65×200=13000
100×130=13000
104×125=13000

Number of Divisors

The number 13000 has 32 divisors, written as τ(13000) = 32 in number theory.

Sum of Divisors

σ(13000) = 1 + 2 + 4 + 5 + 8 + 10 + 13 + 20 + 25 + 26 + 40 + 50 + 52 + 65 + 100 + 104 + 125 + 130 + 200 + 250 + 260 + 325 + 500 + 520 + 650 + 1000 + 1300 + 1625 + 2600 + 3250 + 6500 + 13000 = 32760

Properties of 13000

  • 13000 is composite.
  • 13000 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 32760.

Common Divisors with Another Number?

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

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

  1. 1 divides 13000 (13000 ÷ 1 = 13000) → pair (1, 13000)
  2. 2 divides 13000 (13000 ÷ 2 = 6500) → pair (2, 6500)
  3. 4 divides 13000 (13000 ÷ 4 = 3250) → pair (4, 3250)
  4. 5 divides 13000 (13000 ÷ 5 = 2600) → pair (5, 2600)
  5. 8 divides 13000 (13000 ÷ 8 = 1625) → pair (8, 1625)
  6. 10 divides 13000 (13000 ÷ 10 = 1300) → pair (10, 1300)
  7. 13 divides 13000 (13000 ÷ 13 = 1000) → pair (13, 1000)
  8. 20 divides 13000 (13000 ÷ 20 = 650) → pair (20, 650)
  9. 25 divides 13000 (13000 ÷ 25 = 520) → pair (25, 520)
  10. 26 divides 13000 (13000 ÷ 26 = 500) → pair (26, 500)
  11. 40 divides 13000 (13000 ÷ 40 = 325) → pair (40, 325)
  12. 50 divides 13000 (13000 ÷ 50 = 260) → pair (50, 260)
  13. 52 divides 13000 (13000 ÷ 52 = 250) → pair (52, 250)
  14. 65 divides 13000 (13000 ÷ 65 = 200) → pair (65, 200)
  15. 100 divides 13000 (13000 ÷ 100 = 130) → pair (100, 130)
  16. 104 divides 13000 (13000 ÷ 104 = 125) → pair (104, 125)
  17. Collect all unique values: {1, 2, 4, 5, 8, 10, 13, 20, 25, 26, 40, 50, 52, 65, 100, 104, 125, 130, 200, 250, 260, 325, 500, 520, 650, 1000, 1300, 1625, 2600, 3250, 6500, 13000} — total 32 divisors.
  18. Sum: 1 + 2 + 4 + 5 + 8 + 10 + 13 + 20 + 25 + 26 + 40 + 50 + 52 + 65 + 100 + 104 + 125 + 130 + 200 + 250 + 260 + 325 + 500 + 520 + 650 + 1000 + 1300 + 1625 + 2600 + 3250 + 6500 + 13000 = 32760.

Nearby Examples

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

Related Operations for 13000

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