The number 9153
9153 is a composite number with 10 divisors. Its prime factorisation is × 113. Divisors (10): 1, 3, 9, 27, 81, 113, 339, 1017, 3051, 9153.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9153 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9153 is composite. Its prime factorisation is
- 3
The divisors add up to 13794; without 9153 itself that is 4641, so 9153 is deficient (4641 is less than 9153). Euler's totient φ(9153) = 6048 numbers up to 9153 share no factor with it.
- 4
The digits of 9153 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9153 = 3^{4} \times 113 \]9153 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 13794 |
| Euler totient φ(n) | 6048 |
| Square | 83777409 |
| Cube | 766814624577 |
| Square root | 95.671312 (= 9√113) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 153 |
| Scientific notation | 9.153 × |
9153 in other forms
| Form | Value |
|---|---|
| In words | nine thousand one hundred and fifty-three |
| Binary (base 2) | 10001111000001 |
| Octal (base 8) | 21701 |
| Hexadecimal (base 16) | 23C1 |
| Base 3 | 110120000 |
| As time | 9153 seconds = 2 h 32 min 33 s |
Is 9153 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (9153 ÷ 3 = 3051) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (9153 ÷ 9 = 1017) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9153 a prime number?
No. 9153 = × 113, so it is divisible by 3.
What are the factors of 9153?
1, 3, 9, 27, 81, 113, 339, 1017, 3051, 9153.
What is 9153 in binary?
10001111000001 (hexadecimal 23C1, octal 21701).
What is the square root of 9153?
About 95.6713, exactly 9√113.
Is 9153 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 9153?
It is a composite number with 10 divisors.