The number 55701
55701 is a composite number with 8 divisors. Its prime factorisation is × 2063. Divisors (8): 1, 3, 9, 27, 2063, 6189, 18567, 55701.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55701: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
55701 is composite. Its prime factorisation is
- 3
The divisors add up to 82560; without 55701 itself that is 26859, so 55701 is deficient (26859 is less than 55701). Euler's totient φ(55701) = 37116 numbers up to 55701 share no factor with it.
- 4
The digits of 55701 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55701 = 3^{3} \times 2063 \]55701 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 82560 |
| Euler totient φ(n) | 37116 |
| Square | 3102601401 |
| Cube | 172818000637101 |
| Square root | 236.010593 (= 3√6189) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.5701 × |
55701 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand seven hundred and one |
| Binary (base 2) | 1101100110010101 |
| Octal (base 8) | 154625 |
| Hexadecimal (base 16) | D995 |
| Base 3 | 2211102000 |
| As time | 55701 seconds = 15 h 28 min 21 s |
Is 55701 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 (55701 ÷ 3 = 18567) | 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 | No (remainder 1) | 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 2) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (55701 ÷ 9 = 6189) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 55701 a prime number?
No. 55701 = × 2063, so it is divisible by 3.
What are the factors of 55701?
1, 3, 9, 27, 2063, 6189, 18567, 55701.
What is 55701 in binary?
1101100110010101 (hexadecimal D995, octal 154625).
What is the square root of 55701?
About 236.0106, exactly 3√6189.
Is 55701 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 55701?
55701 is a happy number: repeatedly adding the squares of its digits reaches 1.