The number 9605
9605 is a composite number with 8 divisors. Its prime factorisation is 5 × 17 × 113. Divisors (8): 1, 5, 17, 85, 113, 565, 1921, 9605.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9605 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9605 is composite. Its prime factorisation is
- 3
The divisors add up to 12312; without 9605 itself that is 2707, so 9605 is deficient (2707 is less than 9605). Euler's totient φ(9605) = 7168 numbers up to 9605 share no factor with it.
- 4
The digits of 9605 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 166 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9605 = 5 \times 17 \times 113 \]
9605 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 12312 |
| Euler totient φ(n) | 7168 |
| Square | 92256025 |
| Cube | 886119120125 |
| Square root | 98.005102 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 166 |
| Scientific notation | 9.605 × |
9605 in other forms
| Form | Value |
|---|---|
| In words | nine thousand six hundred and five |
| Binary (base 2) | 10010110000101 |
| Octal (base 8) | 22605 |
| Hexadecimal (base 16) | 2585 |
| Base 3 | 111011202 |
| As time | 9605 seconds = 2 h 40 min 5 s |
Is 9605 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 | No (remainder 2) | 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 | Yes (9605 ÷ 5 = 1921) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 | No (remainder 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9605 a prime number?
No. 9605 = 5 × 17 × 113, so it is divisible by 5.
What are the factors of 9605?
1, 5, 17, 85, 113, 565, 1921, 9605.
What is 9605 in binary?
10010110000101 (hexadecimal 2585, octal 22605).
What is the square root of 9605?
About 98.0051.
Is 9605 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 9605?
It is a composite number with 8 divisors.