The number 9136
9136 is a composite number with 10 divisors. Its prime factorisation is × 571. Divisors (10): 1, 2, 4, 8, 16, 571, 1142, 2284, 4568, 9136.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9136 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9136 is composite. Its prime factorisation is
- 3
The divisors add up to 17732; without 9136 itself that is 8596, so 9136 is deficient (8596 is less than 9136). Euler's totient φ(9136) = 4560 numbers up to 9136 share no factor with it.
- 4
The digits of 9136 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 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9136 = 2^{4} \times 571 \]9136 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 17732 |
| Euler totient φ(n) | 4560 |
| Square | 83466496 |
| Cube | 762549907456 |
| Square root | 95.582425 (= 4√571) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 34 |
| Scientific notation | 9.136 × |
9136 in other forms
| Form | Value |
|---|---|
| In words | nine thousand one hundred and thirty-six |
| Binary (base 2) | 10001110110000 |
| Octal (base 8) | 21660 |
| Hexadecimal (base 16) | 23B0 |
| Base 3 | 110112101 |
| As time | 9136 seconds = 2 h 32 min 16 s |
Is 9136 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9136 ÷ 2 = 4568) | 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 (9136 ÷ 4 = 2284) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 1) | 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 (9136 ÷ 8 = 1142) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 9136 a prime number?
No. 9136 = × 571, so it is divisible by 2.
What are the factors of 9136?
1, 2, 4, 8, 16, 571, 1142, 2284, 4568, 9136.
What is 9136 in binary?
10001110110000 (hexadecimal 23B0, octal 21660).
What is the square root of 9136?
About 95.5824, exactly 4√571.
Is 9136 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 9136?
It is a composite number with 10 divisors.