Divisors of 30429: All 24 Factors
Quick Answer
30429 has 24 divisors (factors): 1, 3, 7, 9, 21, 23, 27, 49, 63, 69, 147, 161, 189, 207, 441, 483, 621, 1127, 1323, 1449, 3381, 4347, 10143, 30429.
Sum: 54720.
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 30429
The number 30429 has 24 divisors:
1, 3, 7, 9, 21, 23, 27, 49, 63, 69, 147, 161, 189, 207, 441, 483, 621, 1127, 1323, 1449, 3381, 4347, 10143, 30429
Divisor Pairs of 30429
Each pair multiplies to 30429:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 30429 | = | 30429 |
| 3 | × | 10143 | = | 30429 |
| 7 | × | 4347 | = | 30429 |
| 9 | × | 3381 | = | 30429 |
| 21 | × | 1449 | = | 30429 |
| 23 | × | 1323 | = | 30429 |
| 27 | × | 1127 | = | 30429 |
| 49 | × | 621 | = | 30429 |
| 63 | × | 483 | = | 30429 |
| 69 | × | 441 | = | 30429 |
| 147 | × | 207 | = | 30429 |
| 161 | × | 189 | = | 30429 |
Number of Divisors
The number 30429 has 24 divisors, written as τ(30429) = 24 in number theory.
Sum of Divisors
σ(30429) = 1 + 3 + 7 + 9 + 21 + 23 + 27 + 49 + 63 + 69 + 147 + 161 + 189 + 207 + 441 + 483 + 621 + 1127 + 1323 + 1449 + 3381 + 4347 + 10143 + 30429 = 54720
Prime Factorization of 30429
Properties of 30429
- 30429 is composite.
- 30429 is not a perfect square.
- Number of divisors: 24.
- Sum of divisors: 54720.
Common Divisors with Another Number?
Looking for the divisors that 30429 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 30429
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √30429 ≈ 174.44. If i divides 30429, then both i and 30429/i are divisors.
- 1 divides 30429 (30429 ÷ 1 = 30429) → pair (1, 30429)
- 3 divides 30429 (30429 ÷ 3 = 10143) → pair (3, 10143)
- 7 divides 30429 (30429 ÷ 7 = 4347) → pair (7, 4347)
- 9 divides 30429 (30429 ÷ 9 = 3381) → pair (9, 3381)
- 21 divides 30429 (30429 ÷ 21 = 1449) → pair (21, 1449)
- 23 divides 30429 (30429 ÷ 23 = 1323) → pair (23, 1323)
- 27 divides 30429 (30429 ÷ 27 = 1127) → pair (27, 1127)
- 49 divides 30429 (30429 ÷ 49 = 621) → pair (49, 621)
- 63 divides 30429 (30429 ÷ 63 = 483) → pair (63, 483)
- 69 divides 30429 (30429 ÷ 69 = 441) → pair (69, 441)
- 147 divides 30429 (30429 ÷ 147 = 207) → pair (147, 207)
- 161 divides 30429 (30429 ÷ 161 = 189) → pair (161, 189)
- Collect all unique values: {1, 3, 7, 9, 21, 23, 27, 49, 63, 69, 147, 161, 189, 207, 441, 483, 621, 1127, 1323, 1449, 3381, 4347, 10143, 30429} — total 24 divisors.
- Sum: 1 + 3 + 7 + 9 + 21 + 23 + 27 + 49 + 63 + 69 + 147 + 161 + 189 + 207 + 441 + 483 + 621 + 1127 + 1323 + 1449 + 3381 + 4347 + 10143 + 30429 = 54720.
Nearby Examples
Related Operations for 30429
- Multiples of a Number — "outward" complement of divisors
- 30429 Prime Factorization — decompose into prime building blocks
- Find GCF of 30429 and another number
- Find LCM of 30429 and another number
- Is 30429 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