The number 9606
9606 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 1601. Divisors (8): 1, 2, 3, 6, 1601, 3202, 4803, 9606.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9606 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9606 is composite. Its prime factorisation is
- 3
The divisors add up to 19224; without 9606 itself that is 9618, so 9606 is abundant (9618 is more than 9606). Euler's totient φ(9606) = 3200 numbers up to 9606 share no factor with it.
- 4
The digits of 9606 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 166 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9606 = 2 \times 3 \times 1601 \]
9606 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 19224 |
| Euler totient φ(n) | 3200 |
| Square | 92275236 |
| Cube | 886395917016 |
| Square root | 98.010204 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 166 |
| Scientific notation | 9.606 × |
9606 in other forms
| Form | Value |
|---|---|
| In words | nine thousand six hundred and six |
| Binary (base 2) | 10010110000110 |
| Octal (base 8) | 22606 |
| Hexadecimal (base 16) | 2586 |
| Base 3 | 111011210 |
| As time | 9606 seconds = 2 h 40 min 6 s |
Is 9606 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9606 ÷ 2 = 4803) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (9606 ÷ 3 = 3202) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 | Yes (9606 ÷ 6 = 1601) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9606 a prime number?
No. 9606 = 2 × 3 × 1601, so it is divisible by 2.
What are the factors of 9606?
1, 2, 3, 6, 1601, 3202, 4803, 9606.
What is 9606 in binary?
10010110000110 (hexadecimal 2586, octal 22606).
What is the square root of 9606?
About 98.0102.
Is 9606 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 9606?
It is a composite number with 8 divisors.