Divisors of 48020: All 30 Factors
Quick Answer
48020 has 30 divisors (factors): 1, 2, 4, 5, 7, 10, 14, 20, 28, 35, 49, 70, 98, 140, 196, 245, 343, 490, 686, 980, 1372, 1715, 2401, 3430, 4802, 6860, 9604, 12005, 24010, 48020.
Sum: 117642.
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 48020
The number 48020 has 30 divisors:
1, 2, 4, 5, 7, 10, 14, 20, 28, 35, 49, 70, 98, 140, 196, 245, 343, 490, 686, 980, 1372, 1715, 2401, 3430, 4802, 6860, 9604, 12005, 24010, 48020
Divisor Pairs of 48020
Each pair multiplies to 48020:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 48020 | = | 48020 |
| 2 | × | 24010 | = | 48020 |
| 4 | × | 12005 | = | 48020 |
| 5 | × | 9604 | = | 48020 |
| 7 | × | 6860 | = | 48020 |
| 10 | × | 4802 | = | 48020 |
| 14 | × | 3430 | = | 48020 |
| 20 | × | 2401 | = | 48020 |
| 28 | × | 1715 | = | 48020 |
| 35 | × | 1372 | = | 48020 |
| 49 | × | 980 | = | 48020 |
| 70 | × | 686 | = | 48020 |
| 98 | × | 490 | = | 48020 |
| 140 | × | 343 | = | 48020 |
| 196 | × | 245 | = | 48020 |
Number of Divisors
The number 48020 has 30 divisors, written as τ(48020) = 30 in number theory.
Sum of Divisors
σ(48020) = 1 + 2 + 4 + 5 + 7 + 10 + 14 + 20 + 28 + 35 + 49 + 70 + 98 + 140 + 196 + 245 + 343 + 490 + 686 + 980 + 1372 + 1715 + 2401 + 3430 + 4802 + 6860 + 9604 + 12005 + 24010 + 48020 = 117642
Prime Factorization of 48020
Properties of 48020
- 48020 is composite.
- 48020 is not a perfect square.
- Number of divisors: 30.
- Sum of divisors: 117642.
Common Divisors with Another Number?
Looking for the divisors that 48020 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 48020
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √48020 ≈ 219.13. If i divides 48020, then both i and 48020/i are divisors.
- 1 divides 48020 (48020 ÷ 1 = 48020) → pair (1, 48020)
- 2 divides 48020 (48020 ÷ 2 = 24010) → pair (2, 24010)
- 4 divides 48020 (48020 ÷ 4 = 12005) → pair (4, 12005)
- 5 divides 48020 (48020 ÷ 5 = 9604) → pair (5, 9604)
- 7 divides 48020 (48020 ÷ 7 = 6860) → pair (7, 6860)
- 10 divides 48020 (48020 ÷ 10 = 4802) → pair (10, 4802)
- 14 divides 48020 (48020 ÷ 14 = 3430) → pair (14, 3430)
- 20 divides 48020 (48020 ÷ 20 = 2401) → pair (20, 2401)
- 28 divides 48020 (48020 ÷ 28 = 1715) → pair (28, 1715)
- 35 divides 48020 (48020 ÷ 35 = 1372) → pair (35, 1372)
- 49 divides 48020 (48020 ÷ 49 = 980) → pair (49, 980)
- 70 divides 48020 (48020 ÷ 70 = 686) → pair (70, 686)
- 98 divides 48020 (48020 ÷ 98 = 490) → pair (98, 490)
- 140 divides 48020 (48020 ÷ 140 = 343) → pair (140, 343)
- 196 divides 48020 (48020 ÷ 196 = 245) → pair (196, 245)
- Collect all unique values: {1, 2, 4, 5, 7, 10, 14, 20, 28, 35, 49, 70, 98, 140, 196, 245, 343, 490, 686, 980, 1372, 1715, 2401, 3430, 4802, 6860, 9604, 12005, 24010, 48020} — total 30 divisors.
- Sum: 1 + 2 + 4 + 5 + 7 + 10 + 14 + 20 + 28 + 35 + 49 + 70 + 98 + 140 + 196 + 245 + 343 + 490 + 686 + 980 + 1372 + 1715 + 2401 + 3430 + 4802 + 6860 + 9604 + 12005 + 24010 + 48020 = 117642.
Nearby Examples
Related Operations for 48020
- Multiples of a Number — "outward" complement of divisors
- 48020 Prime Factorization — decompose into prime building blocks
- Find GCF of 48020 and another number
- Find LCM of 48020 and another number
- Is 48020 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