Divisors of 48330: All 32 Factors
Quick Answer
48330 has 32 divisors (factors): 1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 90, 135, 179, 270, 358, 537, 895, 1074, 1611, 1790, 2685, 3222, 4833, 5370, 8055, 9666, 16110, 24165, 48330.
Sum: 129600.
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 48330
The number 48330 has 32 divisors:
1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 90, 135, 179, 270, 358, 537, 895, 1074, 1611, 1790, 2685, 3222, 4833, 5370, 8055, 9666, 16110, 24165, 48330
Divisor Pairs of 48330
Each pair multiplies to 48330:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 48330 | = | 48330 |
| 2 | × | 24165 | = | 48330 |
| 3 | × | 16110 | = | 48330 |
| 5 | × | 9666 | = | 48330 |
| 6 | × | 8055 | = | 48330 |
| 9 | × | 5370 | = | 48330 |
| 10 | × | 4833 | = | 48330 |
| 15 | × | 3222 | = | 48330 |
| 18 | × | 2685 | = | 48330 |
| 27 | × | 1790 | = | 48330 |
| 30 | × | 1611 | = | 48330 |
| 45 | × | 1074 | = | 48330 |
| 54 | × | 895 | = | 48330 |
| 90 | × | 537 | = | 48330 |
| 135 | × | 358 | = | 48330 |
| 179 | × | 270 | = | 48330 |
Number of Divisors
The number 48330 has 32 divisors, written as τ(48330) = 32 in number theory.
Sum of Divisors
σ(48330) = 1 + 2 + 3 + 5 + 6 + 9 + 10 + 15 + 18 + 27 + 30 + 45 + 54 + 90 + 135 + 179 + 270 + 358 + 537 + 895 + 1074 + 1611 + 1790 + 2685 + 3222 + 4833 + 5370 + 8055 + 9666 + 16110 + 24165 + 48330 = 129600
Prime Factorization of 48330
Properties of 48330
- 48330 is composite.
- 48330 is not a perfect square.
- Number of divisors: 32.
- Sum of divisors: 129600.
Common Divisors with Another Number?
Looking for the divisors that 48330 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 48330
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √48330 ≈ 219.84. If i divides 48330, then both i and 48330/i are divisors.
- 1 divides 48330 (48330 ÷ 1 = 48330) → pair (1, 48330)
- 2 divides 48330 (48330 ÷ 2 = 24165) → pair (2, 24165)
- 3 divides 48330 (48330 ÷ 3 = 16110) → pair (3, 16110)
- 5 divides 48330 (48330 ÷ 5 = 9666) → pair (5, 9666)
- 6 divides 48330 (48330 ÷ 6 = 8055) → pair (6, 8055)
- 9 divides 48330 (48330 ÷ 9 = 5370) → pair (9, 5370)
- 10 divides 48330 (48330 ÷ 10 = 4833) → pair (10, 4833)
- 15 divides 48330 (48330 ÷ 15 = 3222) → pair (15, 3222)
- 18 divides 48330 (48330 ÷ 18 = 2685) → pair (18, 2685)
- 27 divides 48330 (48330 ÷ 27 = 1790) → pair (27, 1790)
- 30 divides 48330 (48330 ÷ 30 = 1611) → pair (30, 1611)
- 45 divides 48330 (48330 ÷ 45 = 1074) → pair (45, 1074)
- 54 divides 48330 (48330 ÷ 54 = 895) → pair (54, 895)
- 90 divides 48330 (48330 ÷ 90 = 537) → pair (90, 537)
- 135 divides 48330 (48330 ÷ 135 = 358) → pair (135, 358)
- 179 divides 48330 (48330 ÷ 179 = 270) → pair (179, 270)
- Collect all unique values: {1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 90, 135, 179, 270, 358, 537, 895, 1074, 1611, 1790, 2685, 3222, 4833, 5370, 8055, 9666, 16110, 24165, 48330} — total 32 divisors.
- Sum: 1 + 2 + 3 + 5 + 6 + 9 + 10 + 15 + 18 + 27 + 30 + 45 + 54 + 90 + 135 + 179 + 270 + 358 + 537 + 895 + 1074 + 1611 + 1790 + 2685 + 3222 + 4833 + 5370 + 8055 + 9666 + 16110 + 24165 + 48330 = 129600.
Nearby Examples
Related Operations for 48330
- Multiples of a Number — "outward" complement of divisors
- 48330 Prime Factorization — decompose into prime building blocks
- Find GCF of 48330 and another number
- Find LCM of 48330 and another number
- Is 48330 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