Divisors of 48114: All 32 Factors
Quick Answer
48114 has 32 divisors (factors): 1, 2, 3, 6, 9, 11, 18, 22, 27, 33, 54, 66, 81, 99, 162, 198, 243, 297, 486, 594, 729, 891, 1458, 1782, 2187, 2673, 4374, 5346, 8019, 16038, 24057, 48114.
Sum: 118080.
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 48114
The number 48114 has 32 divisors:
1, 2, 3, 6, 9, 11, 18, 22, 27, 33, 54, 66, 81, 99, 162, 198, 243, 297, 486, 594, 729, 891, 1458, 1782, 2187, 2673, 4374, 5346, 8019, 16038, 24057, 48114
Divisor Pairs of 48114
Each pair multiplies to 48114:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 48114 | = | 48114 |
| 2 | × | 24057 | = | 48114 |
| 3 | × | 16038 | = | 48114 |
| 6 | × | 8019 | = | 48114 |
| 9 | × | 5346 | = | 48114 |
| 11 | × | 4374 | = | 48114 |
| 18 | × | 2673 | = | 48114 |
| 22 | × | 2187 | = | 48114 |
| 27 | × | 1782 | = | 48114 |
| 33 | × | 1458 | = | 48114 |
| 54 | × | 891 | = | 48114 |
| 66 | × | 729 | = | 48114 |
| 81 | × | 594 | = | 48114 |
| 99 | × | 486 | = | 48114 |
| 162 | × | 297 | = | 48114 |
| 198 | × | 243 | = | 48114 |
Number of Divisors
The number 48114 has 32 divisors, written as τ(48114) = 32 in number theory.
Sum of Divisors
σ(48114) = 1 + 2 + 3 + 6 + 9 + 11 + 18 + 22 + 27 + 33 + 54 + 66 + 81 + 99 + 162 + 198 + 243 + 297 + 486 + 594 + 729 + 891 + 1458 + 1782 + 2187 + 2673 + 4374 + 5346 + 8019 + 16038 + 24057 + 48114 = 118080
Prime Factorization of 48114
Properties of 48114
- 48114 is composite.
- 48114 is not a perfect square.
- Number of divisors: 32.
- Sum of divisors: 118080.
Common Divisors with Another Number?
Looking for the divisors that 48114 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 48114
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √48114 ≈ 219.35. If i divides 48114, then both i and 48114/i are divisors.
- 1 divides 48114 (48114 ÷ 1 = 48114) → pair (1, 48114)
- 2 divides 48114 (48114 ÷ 2 = 24057) → pair (2, 24057)
- 3 divides 48114 (48114 ÷ 3 = 16038) → pair (3, 16038)
- 6 divides 48114 (48114 ÷ 6 = 8019) → pair (6, 8019)
- 9 divides 48114 (48114 ÷ 9 = 5346) → pair (9, 5346)
- 11 divides 48114 (48114 ÷ 11 = 4374) → pair (11, 4374)
- 18 divides 48114 (48114 ÷ 18 = 2673) → pair (18, 2673)
- 22 divides 48114 (48114 ÷ 22 = 2187) → pair (22, 2187)
- 27 divides 48114 (48114 ÷ 27 = 1782) → pair (27, 1782)
- 33 divides 48114 (48114 ÷ 33 = 1458) → pair (33, 1458)
- 54 divides 48114 (48114 ÷ 54 = 891) → pair (54, 891)
- 66 divides 48114 (48114 ÷ 66 = 729) → pair (66, 729)
- 81 divides 48114 (48114 ÷ 81 = 594) → pair (81, 594)
- 99 divides 48114 (48114 ÷ 99 = 486) → pair (99, 486)
- 162 divides 48114 (48114 ÷ 162 = 297) → pair (162, 297)
- 198 divides 48114 (48114 ÷ 198 = 243) → pair (198, 243)
- Collect all unique values: {1, 2, 3, 6, 9, 11, 18, 22, 27, 33, 54, 66, 81, 99, 162, 198, 243, 297, 486, 594, 729, 891, 1458, 1782, 2187, 2673, 4374, 5346, 8019, 16038, 24057, 48114} — total 32 divisors.
- Sum: 1 + 2 + 3 + 6 + 9 + 11 + 18 + 22 + 27 + 33 + 54 + 66 + 81 + 99 + 162 + 198 + 243 + 297 + 486 + 594 + 729 + 891 + 1458 + 1782 + 2187 + 2673 + 4374 + 5346 + 8019 + 16038 + 24057 + 48114 = 118080.
Nearby Examples
Related Operations for 48114
- Multiples of a Number — "outward" complement of divisors
- 48114 Prime Factorization — decompose into prime building blocks
- Find GCF of 48114 and another number
- Find LCM of 48114 and another number
- Is 48114 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