The number 16705
16705 is a binary palindrome (100000101000001). Its prime factorisation is 5 × 13 × 257. Divisors (8): 1, 5, 13, 65, 257, 1285, 3341, 16705.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16705: a binary palindrome (100000101000001).
- 2
16705 is composite. Its prime factorisation is
- 3
The divisors add up to 21672; without 16705 itself that is 4967, so 16705 is deficient (4967 is less than 16705). Euler's totient φ(16705) = 12288 numbers up to 16705 share no factor with it.
- 4
The digits of 16705 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 128 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16705 = 5 \times 13 \times 257 \]
16705 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 21672 |
| Euler totient φ(n) | 12288 |
| Square | 279057025 |
| Cube | 4661647602625 |
| Square root | 129.247824 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 128 |
| Scientific notation | 1.6705 × |
16705 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand seven hundred and five |
| Binary (base 2) | 100000101000001 |
| Octal (base 8) | 40501 |
| Hexadecimal (base 16) | 4141 |
| Base 3 | 211220201 |
| As time | 16705 seconds = 4 h 38 min 25 s |
Is 16705 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 1) | 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 (16705 ÷ 5 = 3341) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 1) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16705 a prime number?
No. 16705 = 5 × 13 × 257, so it is divisible by 5.
What are the factors of 16705?
1, 5, 13, 65, 257, 1285, 3341, 16705.
What is 16705 in binary?
100000101000001 (hexadecimal 4141, octal 40501).
What is the square root of 16705?
About 129.2478.
Is 16705 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 16705?
16705 is a binary palindrome (100000101000001).