The number 29460
29460 is a composite number with 24 divisors. Its prime factorisation is × 3 × 5 × 491. Divisors (24): 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 491, 982, 1473, 1964 … 29460.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
29460 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
29460 is composite. Its prime factorisation is
- 3
The divisors add up to 82656; without 29460 itself that is 53196, so 29460 is abundant (53196 is more than 29460). Euler's totient φ(29460) = 7840 numbers up to 29460 share no factor with it.
- 4
The digits of 29460 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 134 steps to reach 1.
LaTeX source of the formulas on this page
\[ 29460 = 2^{2} \times 3 \times 5 \times 491 \]29460 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 82656 |
| Euler totient φ(n) | 7840 |
| Square | 867891600 |
| Cube | 25568086536000 |
| Square root | 171.639156 (= 2√7365) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 134 |
| Scientific notation | 2.946 × |
29460 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand four hundred and sixty |
| Binary (base 2) | 111001100010100 |
| Octal (base 8) | 71424 |
| Hexadecimal (base 16) | 7314 |
| Base 3 | 1111102010 |
| As time | 29460 seconds = 8 h 11 min 0 s |
Is 29460 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (29460 ÷ 2 = 14730) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (29460 ÷ 3 = 9820) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (29460 ÷ 4 = 7365) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (29460 ÷ 5 = 5892) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (29460 ÷ 6 = 4910) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (29460 ÷ 10 = 2946) | 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 | Yes (29460 ÷ 12 = 2455) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 29460 a prime number?
No. 29460 = × 3 × 5 × 491, so it is divisible by 2.
What are the factors of 29460?
1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 491, 982, 1473, 1964, 2455, 2946, 4910, 5892, 7365, 9820, 14730, 29460.
What is 29460 in binary?
111001100010100 (hexadecimal 7314, octal 71424).
What is the square root of 29460?
About 171.6392, exactly 2√7365.
Is 29460 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 29460?
It is a composite number with 24 divisors.