Divisors of 64960: All 56 Factors
Quick Answer
64960 has 56 divisors (factors): 1, 2, 4, 5, 7, 8, 10, 14, 16, 20, 28, 29, 32, 35, 40, 56, 58, 64, 70, 80, 112, 116, 140, 145, 160, 203, 224, 232, 280, 290, 320, 406, 448, 464, 560, 580, 812, 928, 1015, 1120, 1160, 1624, 1856, 2030, 2240, 2320, 3248, 4060, 4640, 6496, 8120, 9280, 12992, 16240, 32480, 64960.
Sum: 182880.
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 64960
The number 64960 has 56 divisors:
1, 2, 4, 5, 7, 8, 10, 14, 16, 20, 28, 29, 32, 35, 40, 56, 58, 64, 70, 80, 112, 116, 140, 145, 160, 203, 224, 232, 280, 290, 320, 406, 448, 464, 560, 580, 812, 928, 1015, 1120, 1160, 1624, 1856, 2030, 2240, 2320, 3248, 4060, 4640, 6496, 8120, 9280, 12992, 16240, 32480, 64960
Divisor Pairs of 64960
Each pair multiplies to 64960:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 64960 | = | 64960 |
| 2 | × | 32480 | = | 64960 |
| 4 | × | 16240 | = | 64960 |
| 5 | × | 12992 | = | 64960 |
| 7 | × | 9280 | = | 64960 |
| 8 | × | 8120 | = | 64960 |
| 10 | × | 6496 | = | 64960 |
| 14 | × | 4640 | = | 64960 |
| 16 | × | 4060 | = | 64960 |
| 20 | × | 3248 | = | 64960 |
| 28 | × | 2320 | = | 64960 |
| 29 | × | 2240 | = | 64960 |
| 32 | × | 2030 | = | 64960 |
| 35 | × | 1856 | = | 64960 |
| 40 | × | 1624 | = | 64960 |
| 56 | × | 1160 | = | 64960 |
| 58 | × | 1120 | = | 64960 |
| 64 | × | 1015 | = | 64960 |
| 70 | × | 928 | = | 64960 |
| 80 | × | 812 | = | 64960 |
| 112 | × | 580 | = | 64960 |
| 116 | × | 560 | = | 64960 |
| 140 | × | 464 | = | 64960 |
| 145 | × | 448 | = | 64960 |
| 160 | × | 406 | = | 64960 |
| 203 | × | 320 | = | 64960 |
| 224 | × | 290 | = | 64960 |
| 232 | × | 280 | = | 64960 |
Number of Divisors
The number 64960 has 56 divisors, written as τ(64960) = 56 in number theory.
Sum of Divisors
σ(64960) = 1 + 2 + 4 + 5 + 7 + 8 + 10 + 14 + 16 + 20 + 28 + 29 + 32 + 35 + 40 + 56 + 58 + 64 + 70 + 80 + 112 + 116 + 140 + 145 + 160 + 203 + 224 + 232 + 280 + 290 + 320 + 406 + 448 + 464 + 560 + 580 + 812 + 928 + 1015 + 1120 + 1160 + 1624 + 1856 + 2030 + 2240 + 2320 + 3248 + 4060 + 4640 + 6496 + 8120 + 9280 + 12992 + 16240 + 32480 + 64960 = 182880
Prime Factorization of 64960
Properties of 64960
- 64960 is composite.
- 64960 is not a perfect square.
- Number of divisors: 56.
- Sum of divisors: 182880.
Common Divisors with Another Number?
Looking for the divisors that 64960 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 64960
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √64960 ≈ 254.87. If i divides 64960, then both i and 64960/i are divisors.
- 1 divides 64960 (64960 ÷ 1 = 64960) → pair (1, 64960)
- 2 divides 64960 (64960 ÷ 2 = 32480) → pair (2, 32480)
- 4 divides 64960 (64960 ÷ 4 = 16240) → pair (4, 16240)
- 5 divides 64960 (64960 ÷ 5 = 12992) → pair (5, 12992)
- 7 divides 64960 (64960 ÷ 7 = 9280) → pair (7, 9280)
- 8 divides 64960 (64960 ÷ 8 = 8120) → pair (8, 8120)
- 10 divides 64960 (64960 ÷ 10 = 6496) → pair (10, 6496)
- 14 divides 64960 (64960 ÷ 14 = 4640) → pair (14, 4640)
- 16 divides 64960 (64960 ÷ 16 = 4060) → pair (16, 4060)
- 20 divides 64960 (64960 ÷ 20 = 3248) → pair (20, 3248)
- 28 divides 64960 (64960 ÷ 28 = 2320) → pair (28, 2320)
- 29 divides 64960 (64960 ÷ 29 = 2240) → pair (29, 2240)
- 32 divides 64960 (64960 ÷ 32 = 2030) → pair (32, 2030)
- 35 divides 64960 (64960 ÷ 35 = 1856) → pair (35, 1856)
- 40 divides 64960 (64960 ÷ 40 = 1624) → pair (40, 1624)
- 56 divides 64960 (64960 ÷ 56 = 1160) → pair (56, 1160)
- 58 divides 64960 (64960 ÷ 58 = 1120) → pair (58, 1120)
- 64 divides 64960 (64960 ÷ 64 = 1015) → pair (64, 1015)
- 70 divides 64960 (64960 ÷ 70 = 928) → pair (70, 928)
- 80 divides 64960 (64960 ÷ 80 = 812) → pair (80, 812)
- 112 divides 64960 (64960 ÷ 112 = 580) → pair (112, 580)
- 116 divides 64960 (64960 ÷ 116 = 560) → pair (116, 560)
- 140 divides 64960 (64960 ÷ 140 = 464) → pair (140, 464)
- 145 divides 64960 (64960 ÷ 145 = 448) → pair (145, 448)
- 160 divides 64960 (64960 ÷ 160 = 406) → pair (160, 406)
- 203 divides 64960 (64960 ÷ 203 = 320) → pair (203, 320)
- 224 divides 64960 (64960 ÷ 224 = 290) → pair (224, 290)
- 232 divides 64960 (64960 ÷ 232 = 280) → pair (232, 280)
- Collect all unique values: {1, 2, 4, 5, 7, 8, 10, 14, 16, 20, 28, 29, 32, 35, 40, 56, 58, 64, 70, 80, 112, 116, 140, 145, 160, 203, 224, 232, 280, 290, 320, 406, 448, 464, 560, 580, 812, 928, 1015, 1120, 1160, 1624, 1856, 2030, 2240, 2320, 3248, 4060, 4640, 6496, 8120, 9280, 12992, 16240, 32480, 64960} — total 56 divisors.
- Sum: 1 + 2 + 4 + 5 + 7 + 8 + 10 + 14 + 16 + 20 + 28 + 29 + 32 + 35 + 40 + 56 + 58 + 64 + 70 + 80 + 112 + 116 + 140 + 145 + 160 + 203 + 224 + 232 + 280 + 290 + 320 + 406 + 448 + 464 + 560 + 580 + 812 + 928 + 1015 + 1120 + 1160 + 1624 + 1856 + 2030 + 2240 + 2320 + 3248 + 4060 + 4640 + 6496 + 8120 + 9280 + 12992 + 16240 + 32480 + 64960 = 182880.
Nearby Examples
Related Operations for 64960
- Multiples of a Number — "outward" complement of divisors
- 64960 Prime Factorization — decompose into prime building blocks
- Find GCF of 64960 and another number
- Find LCM of 64960 and another number
- Is 64960 a perfect square? (odd divisor count ⇔ yes)
See also our tables of divisors:
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
- Multiples of a Number — "outward" complement
- Prime Factorization — product of prime divisors
- Greatest Common Factor (GCF) — largest common divisor of 2+ numbers
- Least Common Multiple (LCM) — smallest common multiple
- Is N a Perfect Square? — odd divisor count check