The number 29152
29152 is a composite number with 12 divisors. Its prime factorisation is × 911. Divisors (12): 1, 2, 4, 8, 16, 32, 911, 1822, 3644, 7288, 14576, 29152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
29152 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
29152 is composite. Its prime factorisation is
- 3
The divisors add up to 57456; without 29152 itself that is 28304, so 29152 is deficient (28304 is less than 29152). Euler's totient φ(29152) = 14560 numbers up to 29152 share no factor with it.
- 4
The digits of 29152 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 46 steps to reach 1.
LaTeX source of the formulas on this page
\[ 29152 = 2^{5} \times 911 \]29152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 57456 |
| Euler totient φ(n) | 14560 |
| Square | 849839104 |
| Cube | 24774509559808 |
| Square root | 170.739568 (= 4√1822) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 46 |
| Scientific notation | 2.9152 × |
29152 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand one hundred and fifty-two |
| Binary (base 2) | 111000111100000 |
| Octal (base 8) | 70740 |
| Hexadecimal (base 16) | 71E0 |
| Base 3 | 1110222201 |
| As time | 29152 seconds = 8 h 5 min 52 s |
Is 29152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (29152 ÷ 2 = 14576) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (29152 ÷ 4 = 7288) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 | Yes (29152 ÷ 8 = 3644) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 29152 a prime number?
No. 29152 = × 911, so it is divisible by 2.
What are the factors of 29152?
1, 2, 4, 8, 16, 32, 911, 1822, 3644, 7288, 14576, 29152.
What is 29152 in binary?
111000111100000 (hexadecimal 71E0, octal 70740).
What is the square root of 29152?
About 170.7396, exactly 4√1822.
Is 29152 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 29152?
It is a composite number with 12 divisors.