The number 9152
9152 is a composite number with 28 divisors. Its prime factorisation is × 11 × 13. Divisors (28): 1, 2, 4, 8, 11, 13, 16, 22, 26, 32, 44, 52, 64, 88, 104, 143 … 9152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9152 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9152 is composite. Its prime factorisation is
- 3
The divisors add up to 21336; without 9152 itself that is 12184, so 9152 is abundant (12184 is more than 9152). Euler's totient φ(9152) = 3840 numbers up to 9152 share no factor with it.
- 4
The digits of 9152 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 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9152 = 2^{6} \times 11 \times 13 \]9152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 28 |
| Sum of divisors | 21336 |
| Euler totient φ(n) | 3840 |
| Square | 83759104 |
| Cube | 766563319808 |
| Square root | 95.666086 (= 8√143) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 109 |
| Scientific notation | 9.152 × |
9152 in other forms
| Form | Value |
|---|---|
| In words | nine thousand one hundred and fifty-two |
| Binary (base 2) | 10001111000000 |
| Octal (base 8) | 21700 |
| Hexadecimal (base 16) | 23C0 |
| Base 3 | 110112222 |
| As time | 9152 seconds = 2 h 32 min 32 s |
Is 9152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9152 ÷ 2 = 4576) | 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 (9152 ÷ 4 = 2288) | 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 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 | Yes (9152 ÷ 8 = 1144) | 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 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (9152 ÷ 11 = 832) | 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 9152 a prime number?
No. 9152 = × 11 × 13, so it is divisible by 2.
What are the factors of 9152?
1, 2, 4, 8, 11, 13, 16, 22, 26, 32, 44, 52, 64, 88, 104, 143, 176, 208, 286, 352, 416, 572, 704, 832, 1144, 2288, 4576, 9152.
What is 9152 in binary?
10001111000000 (hexadecimal 23C0, octal 21700).
What is the square root of 9152?
About 95.6661, exactly 8√143.
Is 9152 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 9152?
It is a composite number with 28 divisors.