The number 9705
9705 is a binary palindrome (10010111101001). Its prime factorisation is 3 × 5 × 647. Divisors (8): 1, 3, 5, 15, 647, 1941, 3235, 9705.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9705: a binary palindrome (10010111101001).
- 2
9705 is composite. Its prime factorisation is
- 3
The divisors add up to 15552; without 9705 itself that is 5847, so 9705 is deficient (5847 is less than 9705). Euler's totient φ(9705) = 5168 numbers up to 9705 share no factor with it.
- 4
The digits of 9705 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 179 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9705 = 3 \times 5 \times 647 \]
9705 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 15552 |
| Euler totient φ(n) | 5168 |
| Square | 94187025 |
| Cube | 914085077625 |
| Square root | 98.513958 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 179 |
| Scientific notation | 9.705 × |
9705 in other forms
| Form | Value |
|---|---|
| In words | nine thousand seven hundred and five |
| Binary (base 2) | 10010111101001 |
| Octal (base 8) | 22751 |
| Hexadecimal (base 16) | 25E9 |
| Base 3 | 111022110 |
| As time | 9705 seconds = 2 h 41 min 45 s |
Is 9705 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 (9705 ÷ 3 = 3235) | 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 (9705 ÷ 5 = 1941) | 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 3) | 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 | No (remainder 3) | 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 3) | 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 9705 a prime number?
No. 9705 = 3 × 5 × 647, so it is divisible by 3.
What are the factors of 9705?
1, 3, 5, 15, 647, 1941, 3235, 9705.
What is 9705 in binary?
10010111101001 (hexadecimal 25E9, octal 22751).
What is the square root of 9705?
About 98.5140.
Is 9705 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 9705?
9705 is a binary palindrome (10010111101001).