The number 5705
5705 is a composite number with 8 divisors. Its prime factorisation is 5 × 7 × 163. Divisors (8): 1, 5, 7, 35, 163, 815, 1141, 5705.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5705 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5705 is composite. Its prime factorisation is
- 3
The divisors add up to 7872; without 5705 itself that is 2167, so 5705 is deficient (2167 is less than 5705). Euler's totient φ(5705) = 3888 numbers up to 5705 share no factor with it.
- 4
The digits of 5705 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 80 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5705 = 5 \times 7 \times 163 \]
5705 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 7872 |
| Euler totient φ(n) | 3888 |
| Square | 32547025 |
| Cube | 185680777625 |
| Square root | 75.531450 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 80 |
| Scientific notation | 5.705 × |
5705 in other forms
| Form | Value |
|---|---|
| In words | five thousand seven hundred and five |
| Binary (base 2) | 1011001001001 |
| Octal (base 8) | 13111 |
| Hexadecimal (base 16) | 1649 |
| Base 3 | 21211022 |
| As time | 5705 seconds = 1 h 35 min 5 s |
Is 5705 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 (5705 ÷ 5 = 1141) | 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 | Yes (5705 ÷ 7 = 815) | 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 8) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5705 a prime number?
No. 5705 = 5 × 7 × 163, so it is divisible by 5.
What are the factors of 5705?
1, 5, 7, 35, 163, 815, 1141, 5705.
What is 5705 in binary?
1011001001001 (hexadecimal 1649, octal 13111).
What is the square root of 5705?
About 75.5315.
Is 5705 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 5705?
It is a composite number with 8 divisors.