The number 1705
1705 is a composite number with 8 divisors. Its prime factorisation is 5 × 11 × 31. Divisors (8): 1, 5, 11, 31, 55, 155, 341, 1705.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1705 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1705 is composite. Its prime factorisation is
- 3
The divisors add up to 2304; without 1705 itself that is 599, so 1705 is deficient (599 is less than 1705). Euler's totient φ(1705) = 1200 numbers up to 1705 share no factor with it.
- 4
The digits of 1705 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1705 = 5 \times 11 \times 31 \]
1705 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 2304 |
| Euler totient φ(n) | 1200 |
| Square | 2907025 |
| Cube | 4956477625 |
| Square root | 41.291646 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 135 |
| Scientific notation | 1.705 × |
1705 in other forms
| Form | Value |
|---|---|
| In words | one thousand seven hundred and five |
| Roman numerals | MDCCV |
| Binary (base 2) | 11010101001 |
| Octal (base 8) | 3251 |
| Hexadecimal (base 16) | 6A9 |
| Base 3 | 2100011 |
| As time | 1705 seconds = 28 min 25 s |
Is 1705 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 (1705 ÷ 5 = 341) | 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 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 | No (remainder 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 | Yes (1705 ÷ 11 = 155) | 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 1705 a prime number?
No. 1705 = 5 × 11 × 31, so it is divisible by 5.
What are the factors of 1705?
1, 5, 11, 31, 55, 155, 341, 1705.
What is 1705 in binary?
11010101001 (hexadecimal 6A9, octal 3251).
What is the square root of 1705?
About 41.2916.
What is 1705 in Roman numerals?
MDCCV.
Is 1705 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 1705?
It is a composite number with 8 divisors.