Divisors of 65600: 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 65600

The number 65600 has 42 divisors:

1,  2,  4,  5,  8,  10,  16,  20,  25,  32,  40,  41,  50,  64,  80,  82,  100,  160,  164,  200,  205,  320,  328,  400,  410,  656,  800,  820,  1025,  1312,  1600,  1640,  2050,  2624,  3280,  4100,  6560,  8200,  13120,  16400,  32800,  65600

Divisor Pairs of 65600

Each pair multiplies to 65600:

Number of Divisors

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

Sum of Divisors

σ(65600) = 1 + 2 + 4 + 5 + 8 + 10 + 16 + 20 + 25 + 32 + 40 + 41 + 50 + 64 + 80 + 82 + 100 + 160 + 164 + 200 + 205 + 320 + 328 + 400 + 410 + 656 + 800 + 820 + 1025 + 1312 + 1600 + 1640 + 2050 + 2624 + 3280 + 4100 + 6560 + 8200 + 13120 + 16400 + 32800 + 65600 = 165354

Prime Factorization of 65600

See the full prime factorization calculator →

Properties of 65600

• 65600 is composite.
• 65600 is not a perfect square.
• Number of divisors: 42.
• Sum of divisors: 165354.

Common Divisors with Another Number?

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

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

1. 1 divides 65600 (65600 ÷ 1 = 65600) → pair (1, 65600)
2. 2 divides 65600 (65600 ÷ 2 = 32800) → pair (2, 32800)
3. 4 divides 65600 (65600 ÷ 4 = 16400) → pair (4, 16400)
4. 5 divides 65600 (65600 ÷ 5 = 13120) → pair (5, 13120)
5. 8 divides 65600 (65600 ÷ 8 = 8200) → pair (8, 8200)
6. 10 divides 65600 (65600 ÷ 10 = 6560) → pair (10, 6560)
7. 16 divides 65600 (65600 ÷ 16 = 4100) → pair (16, 4100)
8. 20 divides 65600 (65600 ÷ 20 = 3280) → pair (20, 3280)
9. 25 divides 65600 (65600 ÷ 25 = 2624) → pair (25, 2624)
10. 32 divides 65600 (65600 ÷ 32 = 2050) → pair (32, 2050)
11. 40 divides 65600 (65600 ÷ 40 = 1640) → pair (40, 1640)
12. 41 divides 65600 (65600 ÷ 41 = 1600) → pair (41, 1600)
13. 50 divides 65600 (65600 ÷ 50 = 1312) → pair (50, 1312)
14. 64 divides 65600 (65600 ÷ 64 = 1025) → pair (64, 1025)
15. 80 divides 65600 (65600 ÷ 80 = 820) → pair (80, 820)
16. 82 divides 65600 (65600 ÷ 82 = 800) → pair (82, 800)
17. 100 divides 65600 (65600 ÷ 100 = 656) → pair (100, 656)
18. 160 divides 65600 (65600 ÷ 160 = 410) → pair (160, 410)
19. 164 divides 65600 (65600 ÷ 164 = 400) → pair (164, 400)
20. 200 divides 65600 (65600 ÷ 200 = 328) → pair (200, 328)
21. 205 divides 65600 (65600 ÷ 205 = 320) → pair (205, 320)
22. Collect all unique values: {1, 2, 4, 5, 8, 10, 16, 20, 25, 32, 40, 41, 50, 64, 80, 82, 100, 160, 164, 200, 205, 320, 328, 400, 410, 656, 800, 820, 1025, 1312, 1600, 1640, 2050, 2624, 3280, 4100, 6560, 8200, 13120, 16400, 32800, 65600} — total 42 divisors.
23. Sum: 1 + 2 + 4 + 5 + 8 + 10 + 16 + 20 + 25 + 32 + 40 + 41 + 50 + 64 + 80 + 82 + 100 + 160 + 164 + 200 + 205 + 320 + 328 + 400 + 410 + 656 + 800 + 820 + 1025 + 1312 + 1600 + 1640 + 2050 + 2624 + 3280 + 4100 + 6560 + 8200 + 13120 + 16400 + 32800 + 65600 = 165354.

Nearby Examples

Related Operations for 65600

• Multiples of a Number — "outward" complement of divisors
• 65600 Prime Factorization — decompose into prime building blocks
• Find GCF of 65600 and another number
• Find LCM of 65600 and another number
• Is 65600 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: