Divisors of 40960: All 28 Factors
Quick Answer
40960 has 28 divisors (factors): 1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 64, 80, 128, 160, 256, 320, 512, 640, 1024, 1280, 2048, 2560, 4096, 5120, 8192, 10240, 20480, 40960.
Sum: 98298.
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 40960
The number 40960 has 28 divisors:
1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 64, 80, 128, 160, 256, 320, 512, 640, 1024, 1280, 2048, 2560, 4096, 5120, 8192, 10240, 20480, 40960
Divisor Pairs of 40960
Each pair multiplies to 40960:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 40960 | = | 40960 |
| 2 | × | 20480 | = | 40960 |
| 4 | × | 10240 | = | 40960 |
| 5 | × | 8192 | = | 40960 |
| 8 | × | 5120 | = | 40960 |
| 10 | × | 4096 | = | 40960 |
| 16 | × | 2560 | = | 40960 |
| 20 | × | 2048 | = | 40960 |
| 32 | × | 1280 | = | 40960 |
| 40 | × | 1024 | = | 40960 |
| 64 | × | 640 | = | 40960 |
| 80 | × | 512 | = | 40960 |
| 128 | × | 320 | = | 40960 |
| 160 | × | 256 | = | 40960 |
Number of Divisors
The number 40960 has 28 divisors, written as τ(40960) = 28 in number theory.
Sum of Divisors
σ(40960) = 1 + 2 + 4 + 5 + 8 + 10 + 16 + 20 + 32 + 40 + 64 + 80 + 128 + 160 + 256 + 320 + 512 + 640 + 1024 + 1280 + 2048 + 2560 + 4096 + 5120 + 8192 + 10240 + 20480 + 40960 = 98298
Prime Factorization of 40960
Properties of 40960
- 40960 is composite.
- 40960 is not a perfect square.
- Number of divisors: 28.
- Sum of divisors: 98298.
Common Divisors with Another Number?
Looking for the divisors that 40960 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 40960
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √40960 ≈ 202.39. If i divides 40960, then both i and 40960/i are divisors.
- 1 divides 40960 (40960 ÷ 1 = 40960) → pair (1, 40960)
- 2 divides 40960 (40960 ÷ 2 = 20480) → pair (2, 20480)
- 4 divides 40960 (40960 ÷ 4 = 10240) → pair (4, 10240)
- 5 divides 40960 (40960 ÷ 5 = 8192) → pair (5, 8192)
- 8 divides 40960 (40960 ÷ 8 = 5120) → pair (8, 5120)
- 10 divides 40960 (40960 ÷ 10 = 4096) → pair (10, 4096)
- 16 divides 40960 (40960 ÷ 16 = 2560) → pair (16, 2560)
- 20 divides 40960 (40960 ÷ 20 = 2048) → pair (20, 2048)
- 32 divides 40960 (40960 ÷ 32 = 1280) → pair (32, 1280)
- 40 divides 40960 (40960 ÷ 40 = 1024) → pair (40, 1024)
- 64 divides 40960 (40960 ÷ 64 = 640) → pair (64, 640)
- 80 divides 40960 (40960 ÷ 80 = 512) → pair (80, 512)
- 128 divides 40960 (40960 ÷ 128 = 320) → pair (128, 320)
- 160 divides 40960 (40960 ÷ 160 = 256) → pair (160, 256)
- Collect all unique values: {1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 64, 80, 128, 160, 256, 320, 512, 640, 1024, 1280, 2048, 2560, 4096, 5120, 8192, 10240, 20480, 40960} — total 28 divisors.
- Sum: 1 + 2 + 4 + 5 + 8 + 10 + 16 + 20 + 32 + 40 + 64 + 80 + 128 + 160 + 256 + 320 + 512 + 640 + 1024 + 1280 + 2048 + 2560 + 4096 + 5120 + 8192 + 10240 + 20480 + 40960 = 98298.
Nearby Examples
Related Operations for 40960
- Multiples of a Number — "outward" complement of divisors
- 40960 Prime Factorization — decompose into prime building blocks
- Find GCF of 40960 and another number
- Find LCM of 40960 and another number
- Is 40960 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