The number 29130
29130 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 971. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 971, 1942, 2913, 4855, 5826, 9710, 14565, 29130.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 29130: a Harshad number: divisible by its digit sum 15.
- 2
29130 is composite. Its prime factorisation is
- 3
The divisors add up to 69984; without 29130 itself that is 40854, so 29130 is abundant (40854 is more than 29130). Euler's totient φ(29130) = 7760 numbers up to 29130 share no factor with it.
- 4
The digits of 29130 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 121 steps to reach 1.
LaTeX source of the formulas on this page
\[ 29130 = 2 \times 3 \times 5 \times 971 \]
29130 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 69984 |
| Euler totient φ(n) | 7760 |
| Square | 848556900 |
| Cube | 24718462497000 |
| Square root | 170.675130 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 121 |
| Scientific notation | 2.913 × |
29130 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand one hundred and thirty |
| Binary (base 2) | 111000111001010 |
| Octal (base 8) | 70712 |
| Hexadecimal (base 16) | 71CA |
| Base 3 | 1110221220 |
| As time | 29130 seconds = 8 h 5 min 30 s |
Is 29130 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (29130 ÷ 2 = 14565) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (29130 ÷ 3 = 9710) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (29130 ÷ 5 = 5826) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (29130 ÷ 6 = 4855) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | A number is divisible by 7 if double the last digit and subtract it from the rest: the result is a multiple of 7. |
| 8 | No (remainder 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (29130 ÷ 10 = 2913) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 29130 a prime number?
No. 29130 = 2 × 3 × 5 × 971, so it is divisible by 2.
What are the factors of 29130?
1, 2, 3, 5, 6, 10, 15, 30, 971, 1942, 2913, 4855, 5826, 9710, 14565, 29130.
What is 29130 in binary?
111000111001010 (hexadecimal 71CA, octal 70712).
What is the square root of 29130?
About 170.6751.
Is 29130 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 29130?
29130 is a Harshad number: divisible by its digit sum 15.