The number 55570
55570 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 5557. Divisors (8): 1, 2, 5, 10, 5557, 11114, 27785, 55570.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55570 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55570 is composite. Its prime factorisation is
- 3
The divisors add up to 100044; without 55570 itself that is 44474, so 55570 is deficient (44474 is less than 55570). Euler's totient φ(55570) = 22224 numbers up to 55570 share no factor with it.
- 4
The digits of 55570 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 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55570 = 2 \times 5 \times 5557 \]
55570 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 100044 |
| Euler totient φ(n) | 22224 |
| Square | 3088024900 |
| Cube | 171601543693000 |
| Square root | 235.732900 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.557 × |
55570 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand five hundred and seventy |
| Binary (base 2) | 1101100100010010 |
| Octal (base 8) | 154422 |
| Hexadecimal (base 16) | D912 |
| Base 3 | 2211020011 |
| As time | 55570 seconds = 15 h 26 min 10 s |
Is 55570 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55570 ÷ 2 = 27785) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (55570 ÷ 5 = 11114) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 2) | 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 | Yes (55570 ÷ 10 = 5557) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55570 a prime number?
No. 55570 = 2 × 5 × 5557, so it is divisible by 2.
What are the factors of 55570?
1, 2, 5, 10, 5557, 11114, 27785, 55570.
What is 55570 in binary?
1101100100010010 (hexadecimal D912, octal 154422).
What is the square root of 55570?
About 235.7329.
Is 55570 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 55570?
It is a composite number with 8 divisors.