The number 29060
29060 is a composite number with 12 divisors. Its prime factorisation is × 5 × 1453. Divisors (12): 1, 2, 4, 5, 10, 20, 1453, 2906, 5812, 7265, 14530, 29060.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
29060 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
29060 is composite. Its prime factorisation is
- 3
The divisors add up to 61068; without 29060 itself that is 32008, so 29060 is abundant (32008 is more than 29060). Euler's totient φ(29060) = 11616 numbers up to 29060 share no factor with it.
- 4
The digits of 29060 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 165 steps to reach 1.
LaTeX source of the formulas on this page
\[ 29060 = 2^{2} \times 5 \times 1453 \]29060 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 61068 |
| Euler totient φ(n) | 11616 |
| Square | 844483600 |
| Cube | 24540693416000 |
| Square root | 170.469939 (= 2√7265) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 165 |
| Scientific notation | 2.906 × |
29060 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand and sixty |
| Binary (base 2) | 111000110000100 |
| Octal (base 8) | 70604 |
| Hexadecimal (base 16) | 7184 |
| Base 3 | 1110212022 |
| As time | 29060 seconds = 8 h 4 min 20 s |
Is 29060 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (29060 ÷ 2 = 14530) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (29060 ÷ 4 = 7265) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (29060 ÷ 5 = 5812) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (29060 ÷ 10 = 2906) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 29060 a prime number?
No. 29060 = × 5 × 1453, so it is divisible by 2.
What are the factors of 29060?
1, 2, 4, 5, 10, 20, 1453, 2906, 5812, 7265, 14530, 29060.
What is 29060 in binary?
111000110000100 (hexadecimal 7184, octal 70604).
What is the square root of 29060?
About 170.4699, exactly 2√7265.
Is 29060 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 29060?
It is a composite number with 12 divisors.