The number 55370
55370 is a composite number with 24 divisors. Its prime factorisation is 2 × 5 × × 113. Divisors (24): 1, 2, 5, 7, 10, 14, 35, 49, 70, 98, 113, 226, 245, 490, 565, 791 … 55370.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55370 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55370 is composite. Its prime factorisation is
- 3
The divisors add up to 116964; without 55370 itself that is 61594, so 55370 is abundant (61594 is more than 55370). Euler's totient φ(55370) = 18816 numbers up to 55370 share no factor with it.
- 4
The digits of 55370 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55370 = 2 \times 5 \times 7^{2} \times 113 \]55370 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 116964 |
| Euler totient φ(n) | 18816 |
| Square | 3065836900 |
| Cube | 169755389153000 |
| Square root | 235.308308 (= 7√1130) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.537 × |
55370 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand three hundred and seventy |
| Binary (base 2) | 1101100001001010 |
| Octal (base 8) | 154112 |
| Hexadecimal (base 16) | D84A |
| Base 3 | 2210221202 |
| As time | 55370 seconds = 15 h 22 min 50 s |
Is 55370 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55370 ÷ 2 = 27685) | 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 (55370 ÷ 5 = 11074) | 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 | Yes (55370 ÷ 7 = 7910) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (55370 ÷ 10 = 5537) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55370 a prime number?
No. 55370 = 2 × 5 × × 113, so it is divisible by 2.
What are the factors of 55370?
1, 2, 5, 7, 10, 14, 35, 49, 70, 98, 113, 226, 245, 490, 565, 791, 1130, 1582, 3955, 5537, 7910, 11074, 27685, 55370.
What is 55370 in binary?
1101100001001010 (hexadecimal D84A, octal 154112).
What is the square root of 55370?
About 235.3083, exactly 7√1130.
Is 55370 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 55370?
It is a composite number with 24 divisors.