Divisors of 32130: All 64 Factors
Quick Answer
32130 has 64 divisors (factors): 1, 2, 3, 5, 6, 7, 9, 10, 14, 15, 17, 18, 21, 27, 30, 34, 35, 42, 45, 51, 54, 63, 70, 85, 90, 102, 105, 119, 126, 135, 153, 170, 189, 210, 238, 255, 270, 306, 315, 357, 378, 459, 510, 595, 630, 714, 765, 918, 945, 1071, 1190, 1530, 1785, 1890, 2142, 2295, 3213, 3570, 4590, 5355, 6426, 10710, 16065, 32130.
Sum: 103680.
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 32130
The number 32130 has 64 divisors:
1, 2, 3, 5, 6, 7, 9, 10, 14, 15, 17, 18, 21, 27, 30, 34, 35, 42, 45, 51, 54, 63, 70, 85, 90, 102, 105, 119, 126, 135, 153, 170, 189, 210, 238, 255, 270, 306, 315, 357, 378, 459, 510, 595, 630, 714, 765, 918, 945, 1071, 1190, 1530, 1785, 1890, 2142, 2295, 3213, 3570, 4590, 5355, 6426, 10710, 16065, 32130
Divisor Pairs of 32130
Each pair multiplies to 32130:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 32130 | = | 32130 |
| 2 | × | 16065 | = | 32130 |
| 3 | × | 10710 | = | 32130 |
| 5 | × | 6426 | = | 32130 |
| 6 | × | 5355 | = | 32130 |
| 7 | × | 4590 | = | 32130 |
| 9 | × | 3570 | = | 32130 |
| 10 | × | 3213 | = | 32130 |
| 14 | × | 2295 | = | 32130 |
| 15 | × | 2142 | = | 32130 |
| 17 | × | 1890 | = | 32130 |
| 18 | × | 1785 | = | 32130 |
| 21 | × | 1530 | = | 32130 |
| 27 | × | 1190 | = | 32130 |
| 30 | × | 1071 | = | 32130 |
| 34 | × | 945 | = | 32130 |
| 35 | × | 918 | = | 32130 |
| 42 | × | 765 | = | 32130 |
| 45 | × | 714 | = | 32130 |
| 51 | × | 630 | = | 32130 |
| 54 | × | 595 | = | 32130 |
| 63 | × | 510 | = | 32130 |
| 70 | × | 459 | = | 32130 |
| 85 | × | 378 | = | 32130 |
| 90 | × | 357 | = | 32130 |
| 102 | × | 315 | = | 32130 |
| 105 | × | 306 | = | 32130 |
| 119 | × | 270 | = | 32130 |
| 126 | × | 255 | = | 32130 |
| 135 | × | 238 | = | 32130 |
| 153 | × | 210 | = | 32130 |
| 170 | × | 189 | = | 32130 |
Number of Divisors
The number 32130 has 64 divisors, written as τ(32130) = 64 in number theory.
Sum of Divisors
σ(32130) = 1 + 2 + 3 + 5 + 6 + 7 + 9 + 10 + 14 + 15 + 17 + 18 + 21 + 27 + 30 + 34 + 35 + 42 + 45 + 51 + 54 + 63 + 70 + 85 + 90 + 102 + 105 + 119 + 126 + 135 + 153 + 170 + 189 + 210 + 238 + 255 + 270 + 306 + 315 + 357 + 378 + 459 + 510 + 595 + 630 + 714 + 765 + 918 + 945 + 1071 + 1190 + 1530 + 1785 + 1890 + 2142 + 2295 + 3213 + 3570 + 4590 + 5355 + 6426 + 10710 + 16065 + 32130 = 103680
Prime Factorization of 32130
Properties of 32130
- 32130 is composite.
- 32130 is not a perfect square.
- Number of divisors: 64.
- Sum of divisors: 103680.
Common Divisors with Another Number?
Looking for the divisors that 32130 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 32130
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √32130 ≈ 179.25. If i divides 32130, then both i and 32130/i are divisors.
- 1 divides 32130 (32130 ÷ 1 = 32130) → pair (1, 32130)
- 2 divides 32130 (32130 ÷ 2 = 16065) → pair (2, 16065)
- 3 divides 32130 (32130 ÷ 3 = 10710) → pair (3, 10710)
- 5 divides 32130 (32130 ÷ 5 = 6426) → pair (5, 6426)
- 6 divides 32130 (32130 ÷ 6 = 5355) → pair (6, 5355)
- 7 divides 32130 (32130 ÷ 7 = 4590) → pair (7, 4590)
- 9 divides 32130 (32130 ÷ 9 = 3570) → pair (9, 3570)
- 10 divides 32130 (32130 ÷ 10 = 3213) → pair (10, 3213)
- 14 divides 32130 (32130 ÷ 14 = 2295) → pair (14, 2295)
- 15 divides 32130 (32130 ÷ 15 = 2142) → pair (15, 2142)
- 17 divides 32130 (32130 ÷ 17 = 1890) → pair (17, 1890)
- 18 divides 32130 (32130 ÷ 18 = 1785) → pair (18, 1785)
- 21 divides 32130 (32130 ÷ 21 = 1530) → pair (21, 1530)
- 27 divides 32130 (32130 ÷ 27 = 1190) → pair (27, 1190)
- 30 divides 32130 (32130 ÷ 30 = 1071) → pair (30, 1071)
- 34 divides 32130 (32130 ÷ 34 = 945) → pair (34, 945)
- 35 divides 32130 (32130 ÷ 35 = 918) → pair (35, 918)
- 42 divides 32130 (32130 ÷ 42 = 765) → pair (42, 765)
- 45 divides 32130 (32130 ÷ 45 = 714) → pair (45, 714)
- 51 divides 32130 (32130 ÷ 51 = 630) → pair (51, 630)
- 54 divides 32130 (32130 ÷ 54 = 595) → pair (54, 595)
- 63 divides 32130 (32130 ÷ 63 = 510) → pair (63, 510)
- 70 divides 32130 (32130 ÷ 70 = 459) → pair (70, 459)
- 85 divides 32130 (32130 ÷ 85 = 378) → pair (85, 378)
- 90 divides 32130 (32130 ÷ 90 = 357) → pair (90, 357)
- 102 divides 32130 (32130 ÷ 102 = 315) → pair (102, 315)
- 105 divides 32130 (32130 ÷ 105 = 306) → pair (105, 306)
- 119 divides 32130 (32130 ÷ 119 = 270) → pair (119, 270)
- 126 divides 32130 (32130 ÷ 126 = 255) → pair (126, 255)
- 135 divides 32130 (32130 ÷ 135 = 238) → pair (135, 238)
- 153 divides 32130 (32130 ÷ 153 = 210) → pair (153, 210)
- 170 divides 32130 (32130 ÷ 170 = 189) → pair (170, 189)
- Collect all unique values: {1, 2, 3, 5, 6, 7, 9, 10, 14, 15, 17, 18, 21, 27, 30, 34, 35, 42, 45, 51, 54, 63, 70, 85, 90, 102, 105, 119, 126, 135, 153, 170, 189, 210, 238, 255, 270, 306, 315, 357, 378, 459, 510, 595, 630, 714, 765, 918, 945, 1071, 1190, 1530, 1785, 1890, 2142, 2295, 3213, 3570, 4590, 5355, 6426, 10710, 16065, 32130} — total 64 divisors.
- Sum: 1 + 2 + 3 + 5 + 6 + 7 + 9 + 10 + 14 + 15 + 17 + 18 + 21 + 27 + 30 + 34 + 35 + 42 + 45 + 51 + 54 + 63 + 70 + 85 + 90 + 102 + 105 + 119 + 126 + 135 + 153 + 170 + 189 + 210 + 238 + 255 + 270 + 306 + 315 + 357 + 378 + 459 + 510 + 595 + 630 + 714 + 765 + 918 + 945 + 1071 + 1190 + 1530 + 1785 + 1890 + 2142 + 2295 + 3213 + 3570 + 4590 + 5355 + 6426 + 10710 + 16065 + 32130 = 103680.
Nearby Examples
Related Operations for 32130
- Multiples of a Number — "outward" complement of divisors
- 32130 Prime Factorization — decompose into prime building blocks
- Find GCF of 32130 and another number
- Find LCM of 32130 and another number
- Is 32130 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