Divisors of 39040: All 32 Factors
Quick Answer
39040 has 32 divisors (factors): 1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 61, 64, 80, 122, 128, 160, 244, 305, 320, 488, 610, 640, 976, 1220, 1952, 2440, 3904, 4880, 7808, 9760, 19520, 39040.
Sum: 94860.
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 39040
The number 39040 has 32 divisors:
1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 61, 64, 80, 122, 128, 160, 244, 305, 320, 488, 610, 640, 976, 1220, 1952, 2440, 3904, 4880, 7808, 9760, 19520, 39040
Divisor Pairs of 39040
Each pair multiplies to 39040:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 39040 | = | 39040 |
| 2 | × | 19520 | = | 39040 |
| 4 | × | 9760 | = | 39040 |
| 5 | × | 7808 | = | 39040 |
| 8 | × | 4880 | = | 39040 |
| 10 | × | 3904 | = | 39040 |
| 16 | × | 2440 | = | 39040 |
| 20 | × | 1952 | = | 39040 |
| 32 | × | 1220 | = | 39040 |
| 40 | × | 976 | = | 39040 |
| 61 | × | 640 | = | 39040 |
| 64 | × | 610 | = | 39040 |
| 80 | × | 488 | = | 39040 |
| 122 | × | 320 | = | 39040 |
| 128 | × | 305 | = | 39040 |
| 160 | × | 244 | = | 39040 |
Number of Divisors
The number 39040 has 32 divisors, written as τ(39040) = 32 in number theory.
Sum of Divisors
σ(39040) = 1 + 2 + 4 + 5 + 8 + 10 + 16 + 20 + 32 + 40 + 61 + 64 + 80 + 122 + 128 + 160 + 244 + 305 + 320 + 488 + 610 + 640 + 976 + 1220 + 1952 + 2440 + 3904 + 4880 + 7808 + 9760 + 19520 + 39040 = 94860
Prime Factorization of 39040
Properties of 39040
- 39040 is composite.
- 39040 is not a perfect square.
- Number of divisors: 32.
- Sum of divisors: 94860.
Common Divisors with Another Number?
Looking for the divisors that 39040 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 39040
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √39040 ≈ 197.59. If i divides 39040, then both i and 39040/i are divisors.
- 1 divides 39040 (39040 ÷ 1 = 39040) → pair (1, 39040)
- 2 divides 39040 (39040 ÷ 2 = 19520) → pair (2, 19520)
- 4 divides 39040 (39040 ÷ 4 = 9760) → pair (4, 9760)
- 5 divides 39040 (39040 ÷ 5 = 7808) → pair (5, 7808)
- 8 divides 39040 (39040 ÷ 8 = 4880) → pair (8, 4880)
- 10 divides 39040 (39040 ÷ 10 = 3904) → pair (10, 3904)
- 16 divides 39040 (39040 ÷ 16 = 2440) → pair (16, 2440)
- 20 divides 39040 (39040 ÷ 20 = 1952) → pair (20, 1952)
- 32 divides 39040 (39040 ÷ 32 = 1220) → pair (32, 1220)
- 40 divides 39040 (39040 ÷ 40 = 976) → pair (40, 976)
- 61 divides 39040 (39040 ÷ 61 = 640) → pair (61, 640)
- 64 divides 39040 (39040 ÷ 64 = 610) → pair (64, 610)
- 80 divides 39040 (39040 ÷ 80 = 488) → pair (80, 488)
- 122 divides 39040 (39040 ÷ 122 = 320) → pair (122, 320)
- 128 divides 39040 (39040 ÷ 128 = 305) → pair (128, 305)
- 160 divides 39040 (39040 ÷ 160 = 244) → pair (160, 244)
- Collect all unique values: {1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 61, 64, 80, 122, 128, 160, 244, 305, 320, 488, 610, 640, 976, 1220, 1952, 2440, 3904, 4880, 7808, 9760, 19520, 39040} — total 32 divisors.
- Sum: 1 + 2 + 4 + 5 + 8 + 10 + 16 + 20 + 32 + 40 + 61 + 64 + 80 + 122 + 128 + 160 + 244 + 305 + 320 + 488 + 610 + 640 + 976 + 1220 + 1952 + 2440 + 3904 + 4880 + 7808 + 9760 + 19520 + 39040 = 94860.
Nearby Examples
Related Operations for 39040
- Multiples of a Number — "outward" complement of divisors
- 39040 Prime Factorization — decompose into prime building blocks
- Find GCF of 39040 and another number
- Find LCM of 39040 and another number
- Is 39040 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