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