Divisors of 42880: All 32 Factors
Quick Answer
42880 has 32 divisors (factors): 1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 64, 67, 80, 128, 134, 160, 268, 320, 335, 536, 640, 670, 1072, 1340, 2144, 2680, 4288, 5360, 8576, 10720, 21440, 42880.
Sum: 104040.
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 42880
The number 42880 has 32 divisors:
1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 64, 67, 80, 128, 134, 160, 268, 320, 335, 536, 640, 670, 1072, 1340, 2144, 2680, 4288, 5360, 8576, 10720, 21440, 42880
Divisor Pairs of 42880
Each pair multiplies to 42880:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 42880 | = | 42880 |
| 2 | × | 21440 | = | 42880 |
| 4 | × | 10720 | = | 42880 |
| 5 | × | 8576 | = | 42880 |
| 8 | × | 5360 | = | 42880 |
| 10 | × | 4288 | = | 42880 |
| 16 | × | 2680 | = | 42880 |
| 20 | × | 2144 | = | 42880 |
| 32 | × | 1340 | = | 42880 |
| 40 | × | 1072 | = | 42880 |
| 64 | × | 670 | = | 42880 |
| 67 | × | 640 | = | 42880 |
| 80 | × | 536 | = | 42880 |
| 128 | × | 335 | = | 42880 |
| 134 | × | 320 | = | 42880 |
| 160 | × | 268 | = | 42880 |
Number of Divisors
The number 42880 has 32 divisors, written as τ(42880) = 32 in number theory.
Sum of Divisors
σ(42880) = 1 + 2 + 4 + 5 + 8 + 10 + 16 + 20 + 32 + 40 + 64 + 67 + 80 + 128 + 134 + 160 + 268 + 320 + 335 + 536 + 640 + 670 + 1072 + 1340 + 2144 + 2680 + 4288 + 5360 + 8576 + 10720 + 21440 + 42880 = 104040
Prime Factorization of 42880
Properties of 42880
- 42880 is composite.
- 42880 is not a perfect square.
- Number of divisors: 32.
- Sum of divisors: 104040.
Common Divisors with Another Number?
Looking for the divisors that 42880 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 42880
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √42880 ≈ 207.07. If i divides 42880, then both i and 42880/i are divisors.
- 1 divides 42880 (42880 ÷ 1 = 42880) → pair (1, 42880)
- 2 divides 42880 (42880 ÷ 2 = 21440) → pair (2, 21440)
- 4 divides 42880 (42880 ÷ 4 = 10720) → pair (4, 10720)
- 5 divides 42880 (42880 ÷ 5 = 8576) → pair (5, 8576)
- 8 divides 42880 (42880 ÷ 8 = 5360) → pair (8, 5360)
- 10 divides 42880 (42880 ÷ 10 = 4288) → pair (10, 4288)
- 16 divides 42880 (42880 ÷ 16 = 2680) → pair (16, 2680)
- 20 divides 42880 (42880 ÷ 20 = 2144) → pair (20, 2144)
- 32 divides 42880 (42880 ÷ 32 = 1340) → pair (32, 1340)
- 40 divides 42880 (42880 ÷ 40 = 1072) → pair (40, 1072)
- 64 divides 42880 (42880 ÷ 64 = 670) → pair (64, 670)
- 67 divides 42880 (42880 ÷ 67 = 640) → pair (67, 640)
- 80 divides 42880 (42880 ÷ 80 = 536) → pair (80, 536)
- 128 divides 42880 (42880 ÷ 128 = 335) → pair (128, 335)
- 134 divides 42880 (42880 ÷ 134 = 320) → pair (134, 320)
- 160 divides 42880 (42880 ÷ 160 = 268) → pair (160, 268)
- Collect all unique values: {1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 64, 67, 80, 128, 134, 160, 268, 320, 335, 536, 640, 670, 1072, 1340, 2144, 2680, 4288, 5360, 8576, 10720, 21440, 42880} — total 32 divisors.
- Sum: 1 + 2 + 4 + 5 + 8 + 10 + 16 + 20 + 32 + 40 + 64 + 67 + 80 + 128 + 134 + 160 + 268 + 320 + 335 + 536 + 640 + 670 + 1072 + 1340 + 2144 + 2680 + 4288 + 5360 + 8576 + 10720 + 21440 + 42880 = 104040.
Nearby Examples
Related Operations for 42880
- Multiples of a Number — "outward" complement of divisors
- 42880 Prime Factorization — decompose into prime building blocks
- Find GCF of 42880 and another number
- Find LCM of 42880 and another number
- Is 42880 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