Divisors of 25600: All 33 Factors

Quick Answer

25600 has 33 divisors (factors): 1, 2, 4, 5, 8, 10, 16, 20, 25, 32, 40, 50, 64, 80, 100, 128, 160, 200, 256, 320, 400, 512, 640, 800, 1024, 1280, 1600, 2560, 3200, 5120, 6400, 12800, 25600.

Sum: 63457.  25600 is a perfect square (√25600 = 160).

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
33 divisors
1, 2, 4, 5, 8, 10, 16, 20, 25, 32, 40, 50, 64, 80, 100, 128, 160, 200, 256, 320, 400, 512, 640, 800, 1024, 1280, 1600, 2560, 3200, 5120, 6400, 12800, 25600

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 25600

The number 25600 has 33 divisors:

1,  2,  4,  5,  8,  10,  16,  20,  25,  32,  40,  50,  64,  80,  100,  128,  160,  200,  256,  320,  400,  512,  640,  800,  1024,  1280,  1600,  2560,  3200,  5120,  6400,  12800,  25600

Divisor Pairs of 25600

Each pair multiplies to 25600:

Factor 1×Factor 2=Product
1×25600=25600
2×12800=25600
4×6400=25600
5×5120=25600
8×3200=25600
10×2560=25600
16×1600=25600
20×1280=25600
25×1024=25600
32×800=25600
40×640=25600
50×512=25600
64×400=25600
80×320=25600
100×256=25600
128×200=25600
160×160=25600

Note: the last pair has identical factors (160 × 160) because 25600 is a perfect square.

Number of Divisors

The number 25600 has 33 divisors, written as τ(25600) = 33 in number theory.

Notice: 25600 has an odd number of divisors — this means 25600 is a perfect square (√25600 = 160).

Sum of Divisors

σ(25600) = 1 + 2 + 4 + 5 + 8 + 10 + 16 + 20 + 25 + 32 + 40 + 50 + 64 + 80 + 100 + 128 + 160 + 200 + 256 + 320 + 400 + 512 + 640 + 800 + 1024 + 1280 + 1600 + 2560 + 3200 + 5120 + 6400 + 12800 + 25600 = 63457

Properties of 25600

  • 25600 is composite.
  • 25600 is a perfect square (√25600 = 160).
  • Number of divisors: 33.
  • Sum of divisors: 63457.

Common Divisors with Another Number?

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

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

  1. 1 divides 25600 (25600 ÷ 1 = 25600) → pair (1, 25600)
  2. 2 divides 25600 (25600 ÷ 2 = 12800) → pair (2, 12800)
  3. 4 divides 25600 (25600 ÷ 4 = 6400) → pair (4, 6400)
  4. 5 divides 25600 (25600 ÷ 5 = 5120) → pair (5, 5120)
  5. 8 divides 25600 (25600 ÷ 8 = 3200) → pair (8, 3200)
  6. 10 divides 25600 (25600 ÷ 10 = 2560) → pair (10, 2560)
  7. 16 divides 25600 (25600 ÷ 16 = 1600) → pair (16, 1600)
  8. 20 divides 25600 (25600 ÷ 20 = 1280) → pair (20, 1280)
  9. 25 divides 25600 (25600 ÷ 25 = 1024) → pair (25, 1024)
  10. 32 divides 25600 (25600 ÷ 32 = 800) → pair (32, 800)
  11. 40 divides 25600 (25600 ÷ 40 = 640) → pair (40, 640)
  12. 50 divides 25600 (25600 ÷ 50 = 512) → pair (50, 512)
  13. 64 divides 25600 (25600 ÷ 64 = 400) → pair (64, 400)
  14. 80 divides 25600 (25600 ÷ 80 = 320) → pair (80, 320)
  15. 100 divides 25600 (25600 ÷ 100 = 256) → pair (100, 256)
  16. 128 divides 25600 (25600 ÷ 128 = 200) → pair (128, 200)
  17. 160 divides 25600 (25600 ÷ 160 = 160) → pair (160, 160)
  18. Collect all unique values: {1, 2, 4, 5, 8, 10, 16, 20, 25, 32, 40, 50, 64, 80, 100, 128, 160, 200, 256, 320, 400, 512, 640, 800, 1024, 1280, 1600, 2560, 3200, 5120, 6400, 12800, 25600} — total 33 divisors.
  19. Sum: 1 + 2 + 4 + 5 + 8 + 10 + 16 + 20 + 25 + 32 + 40 + 50 + 64 + 80 + 100 + 128 + 160 + 200 + 256 + 320 + 400 + 512 + 640 + 800 + 1024 + 1280 + 1600 + 2560 + 3200 + 5120 + 6400 + 12800 + 25600 = 63457.

Nearby Examples

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

Related Operations for 25600

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