The number 9608
9608 is a composite number with 8 divisors. Its prime factorisation is × 1201. Divisors (8): 1, 2, 4, 8, 1201, 2402, 4804, 9608.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9608 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9608 is composite. Its prime factorisation is
- 3
The divisors add up to 18030; without 9608 itself that is 8422, so 9608 is deficient (8422 is less than 9608). Euler's totient φ(9608) = 4800 numbers up to 9608 share no factor with it.
- 4
The digits of 9608 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9608 = 2^{3} \times 1201 \]9608 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 18030 |
| Euler totient φ(n) | 4800 |
| Square | 92313664 |
| Cube | 886949683712 |
| Square root | 98.020406 (= 2√2402) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 60 |
| Scientific notation | 9.608 × |
9608 in other forms
| Form | Value |
|---|---|
| In words | nine thousand six hundred and eight |
| Binary (base 2) | 10010110001000 |
| Octal (base 8) | 22610 |
| Hexadecimal (base 16) | 2588 |
| Base 3 | 111011212 |
| As time | 9608 seconds = 2 h 40 min 8 s |
Is 9608 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9608 ÷ 2 = 4804) | 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 (9608 ÷ 4 = 2402) | 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 2) | 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 (9608 ÷ 8 = 1201) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 9608 a prime number?
No. 9608 = × 1201, so it is divisible by 2.
What are the factors of 9608?
1, 2, 4, 8, 1201, 2402, 4804, 9608.
What is 9608 in binary?
10010110001000 (hexadecimal 2588, octal 22610).
What is the square root of 9608?
About 98.0204, exactly 2√2402.
Is 9608 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 9608?
It is a composite number with 8 divisors.