Divisors of 63200: All 36 Factors

Quick Answer

63200 has 36 divisors (factors): 1, 2, 4, 5, 8, 10, 16, 20, 25, 32, 40, 50, 79, 80, 100, 158, 160, 200, 316, 395, 400, 632, 790, 800, 1264, 1580, 1975, 2528, 3160, 3950, 6320, 7900, 12640, 15800, 31600, 63200.

Sum: 156240.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 4, 5, 8, 10, 16, 20, 25, 32, 40, 50, 79, 80, 100, 158, 160, 200, 316, 395, 400, 632, 790, 800, 1264, 1580, 1975, 2528, 3160, 3950, 6320, 7900, 12640, 15800, 31600, 63200

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 63200

The number 63200 has 36 divisors:

1,  2,  4,  5,  8,  10,  16,  20,  25,  32,  40,  50,  79,  80,  100,  158,  160,  200,  316,  395,  400,  632,  790,  800,  1264,  1580,  1975,  2528,  3160,  3950,  6320,  7900,  12640,  15800,  31600,  63200

Divisor Pairs of 63200

Each pair multiplies to 63200:

Factor 1×Factor 2=Product
1×63200=63200
2×31600=63200
4×15800=63200
5×12640=63200
8×7900=63200
10×6320=63200
16×3950=63200
20×3160=63200
25×2528=63200
32×1975=63200
40×1580=63200
50×1264=63200
79×800=63200
80×790=63200
100×632=63200
158×400=63200
160×395=63200
200×316=63200

Number of Divisors

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

Sum of Divisors

σ(63200) = 1 + 2 + 4 + 5 + 8 + 10 + 16 + 20 + 25 + 32 + 40 + 50 + 79 + 80 + 100 + 158 + 160 + 200 + 316 + 395 + 400 + 632 + 790 + 800 + 1264 + 1580 + 1975 + 2528 + 3160 + 3950 + 6320 + 7900 + 12640 + 15800 + 31600 + 63200 = 156240

Properties of 63200

  • 63200 is composite.
  • 63200 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 156240.

Common Divisors with Another Number?

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

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

  1. 1 divides 63200 (63200 ÷ 1 = 63200) → pair (1, 63200)
  2. 2 divides 63200 (63200 ÷ 2 = 31600) → pair (2, 31600)
  3. 4 divides 63200 (63200 ÷ 4 = 15800) → pair (4, 15800)
  4. 5 divides 63200 (63200 ÷ 5 = 12640) → pair (5, 12640)
  5. 8 divides 63200 (63200 ÷ 8 = 7900) → pair (8, 7900)
  6. 10 divides 63200 (63200 ÷ 10 = 6320) → pair (10, 6320)
  7. 16 divides 63200 (63200 ÷ 16 = 3950) → pair (16, 3950)
  8. 20 divides 63200 (63200 ÷ 20 = 3160) → pair (20, 3160)
  9. 25 divides 63200 (63200 ÷ 25 = 2528) → pair (25, 2528)
  10. 32 divides 63200 (63200 ÷ 32 = 1975) → pair (32, 1975)
  11. 40 divides 63200 (63200 ÷ 40 = 1580) → pair (40, 1580)
  12. 50 divides 63200 (63200 ÷ 50 = 1264) → pair (50, 1264)
  13. 79 divides 63200 (63200 ÷ 79 = 800) → pair (79, 800)
  14. 80 divides 63200 (63200 ÷ 80 = 790) → pair (80, 790)
  15. 100 divides 63200 (63200 ÷ 100 = 632) → pair (100, 632)
  16. 158 divides 63200 (63200 ÷ 158 = 400) → pair (158, 400)
  17. 160 divides 63200 (63200 ÷ 160 = 395) → pair (160, 395)
  18. 200 divides 63200 (63200 ÷ 200 = 316) → pair (200, 316)
  19. Collect all unique values: {1, 2, 4, 5, 8, 10, 16, 20, 25, 32, 40, 50, 79, 80, 100, 158, 160, 200, 316, 395, 400, 632, 790, 800, 1264, 1580, 1975, 2528, 3160, 3950, 6320, 7900, 12640, 15800, 31600, 63200} — total 36 divisors.
  20. Sum: 1 + 2 + 4 + 5 + 8 + 10 + 16 + 20 + 25 + 32 + 40 + 50 + 79 + 80 + 100 + 158 + 160 + 200 + 316 + 395 + 400 + 632 + 790 + 800 + 1264 + 1580 + 1975 + 2528 + 3160 + 3950 + 6320 + 7900 + 12640 + 15800 + 31600 + 63200 = 156240.

Nearby Examples

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

Related Operations for 63200

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