Divisors of 59200: All 42 Factors

Divisors (Factors) Calculator

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 59200

The number 59200 has 42 divisors:

1,  2,  4,  5,  8,  10,  16,  20,  25,  32,  37,  40,  50,  64,  74,  80,  100,  148,  160,  185,  200,  296,  320,  370,  400,  592,  740,  800,  925,  1184,  1480,  1600,  1850,  2368,  2960,  3700,  5920,  7400,  11840,  14800,  29600,  59200

Divisor Pairs of 59200

Each pair multiplies to 59200:

Number of Divisors

The number 59200 has 42 divisors, written as τ(59200) = 42 in number theory.

Sum of Divisors

σ(59200) = 1 + 2 + 4 + 5 + 8 + 10 + 16 + 20 + 25 + 32 + 37 + 40 + 50 + 64 + 74 + 80 + 100 + 148 + 160 + 185 + 200 + 296 + 320 + 370 + 400 + 592 + 740 + 800 + 925 + 1184 + 1480 + 1600 + 1850 + 2368 + 2960 + 3700 + 5920 + 7400 + 11840 + 14800 + 29600 + 59200 = 149606

Prime Factorization of 59200

See the full prime factorization calculator →

Properties of 59200

• 59200 is composite.
• 59200 is not a perfect square.
• Number of divisors: 42.
• Sum of divisors: 149606.

Common Divisors with Another Number?

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

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

1. 1 divides 59200 (59200 ÷ 1 = 59200) → pair (1, 59200)
2. 2 divides 59200 (59200 ÷ 2 = 29600) → pair (2, 29600)
3. 4 divides 59200 (59200 ÷ 4 = 14800) → pair (4, 14800)
4. 5 divides 59200 (59200 ÷ 5 = 11840) → pair (5, 11840)
5. 8 divides 59200 (59200 ÷ 8 = 7400) → pair (8, 7400)
6. 10 divides 59200 (59200 ÷ 10 = 5920) → pair (10, 5920)
7. 16 divides 59200 (59200 ÷ 16 = 3700) → pair (16, 3700)
8. 20 divides 59200 (59200 ÷ 20 = 2960) → pair (20, 2960)
9. 25 divides 59200 (59200 ÷ 25 = 2368) → pair (25, 2368)
10. 32 divides 59200 (59200 ÷ 32 = 1850) → pair (32, 1850)
11. 37 divides 59200 (59200 ÷ 37 = 1600) → pair (37, 1600)
12. 40 divides 59200 (59200 ÷ 40 = 1480) → pair (40, 1480)
13. 50 divides 59200 (59200 ÷ 50 = 1184) → pair (50, 1184)
14. 64 divides 59200 (59200 ÷ 64 = 925) → pair (64, 925)
15. 74 divides 59200 (59200 ÷ 74 = 800) → pair (74, 800)
16. 80 divides 59200 (59200 ÷ 80 = 740) → pair (80, 740)
17. 100 divides 59200 (59200 ÷ 100 = 592) → pair (100, 592)
18. 148 divides 59200 (59200 ÷ 148 = 400) → pair (148, 400)
19. 160 divides 59200 (59200 ÷ 160 = 370) → pair (160, 370)
20. 185 divides 59200 (59200 ÷ 185 = 320) → pair (185, 320)
21. 200 divides 59200 (59200 ÷ 200 = 296) → pair (200, 296)
22. Collect all unique values: {1, 2, 4, 5, 8, 10, 16, 20, 25, 32, 37, 40, 50, 64, 74, 80, 100, 148, 160, 185, 200, 296, 320, 370, 400, 592, 740, 800, 925, 1184, 1480, 1600, 1850, 2368, 2960, 3700, 5920, 7400, 11840, 14800, 29600, 59200} — total 42 divisors.
23. Sum: 1 + 2 + 4 + 5 + 8 + 10 + 16 + 20 + 25 + 32 + 37 + 40 + 50 + 64 + 74 + 80 + 100 + 148 + 160 + 185 + 200 + 296 + 320 + 370 + 400 + 592 + 740 + 800 + 925 + 1184 + 1480 + 1600 + 1850 + 2368 + 2960 + 3700 + 5920 + 7400 + 11840 + 14800 + 29600 + 59200 = 149606.

Nearby Examples

Related Operations for 59200

• Multiples of a Number — "outward" complement of divisors
• 59200 Prime Factorization — decompose into prime building blocks
• Find GCF of 59200 and another number
• Find LCM of 59200 and another number
• Is 59200 a perfect square? (odd divisor count ⇔ yes)

See also our tables of divisors:

• Table of all divisors from 1 to 100
• Table of all divisors from 1 to 500
• Table of all divisors from 1 to 1,000
• Table of all divisors from 1 to 10,000

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.

References

• [1] Divisor (Wikipedia)
• [2] Divisor function (Wikipedia)
• [3] Divisor (Wolfram MathWorld)

Divisors Calculation Examples

Find all divisors of these numbers: