The number 55705
55705 is a composite number with 8 divisors. Its prime factorisation is 5 × 13 × 857. Divisors (8): 1, 5, 13, 65, 857, 4285, 11141, 55705.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55705 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55705 is composite. Its prime factorisation is
- 3
The divisors add up to 72072; without 55705 itself that is 16367, so 55705 is deficient (16367 is less than 55705). Euler's totient φ(55705) = 41088 numbers up to 55705 share no factor with it.
- 4
The digits of 55705 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55705 = 5 \times 13 \times 857 \]
55705 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 72072 |
| Euler totient φ(n) | 41088 |
| Square | 3103047025 |
| Cube | 172855234527625 |
| Square root | 236.019067 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.5705 × |
55705 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand seven hundred and five |
| Binary (base 2) | 1101100110011001 |
| Octal (base 8) | 154631 |
| Hexadecimal (base 16) | D999 |
| Base 3 | 2211102011 |
| As time | 55705 seconds = 15 h 28 min 25 s |
Is 55705 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 (55705 ÷ 5 = 11141) | 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 6) | 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 | No (remainder 1) | 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 55705 a prime number?
No. 55705 = 5 × 13 × 857, so it is divisible by 5.
What are the factors of 55705?
1, 5, 13, 65, 857, 4285, 11141, 55705.
What is 55705 in binary?
1101100110011001 (hexadecimal D999, octal 154631).
What is the square root of 55705?
About 236.0191.
Is 55705 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 55705?
It is a composite number with 8 divisors.