The number 55460
55460 is a composite number with 24 divisors. Its prime factorisation is × 5 × 47 × 59. Divisors (24): 1, 2, 4, 5, 10, 20, 47, 59, 94, 118, 188, 235, 236, 295, 470, 590 … 55460.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55460: a Harshad number: divisible by its digit sum 20.
- 2
55460 is composite. Its prime factorisation is
- 3
The divisors add up to 120960; without 55460 itself that is 65500, so 55460 is abundant (65500 is more than 55460). Euler's totient φ(55460) = 21344 numbers up to 55460 share no factor with it.
- 4
The digits of 55460 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 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55460 = 2^{2} \times 5 \times 47 \times 59 \]55460 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 120960 |
| Euler totient φ(n) | 21344 |
| Square | 3075811600 |
| Cube | 170584511336000 |
| Square root | 235.499469 (= 2√13865) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.546 × |
55460 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand four hundred and sixty |
| Binary (base 2) | 1101100010100100 |
| Octal (base 8) | 154244 |
| Hexadecimal (base 16) | D8A4 |
| Base 3 | 2211002002 |
| As time | 55460 seconds = 15 h 24 min 20 s |
Is 55460 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55460 ÷ 2 = 27730) | 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 | Yes (55460 ÷ 4 = 13865) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (55460 ÷ 5 = 11092) | 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 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 4) | 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 (55460 ÷ 10 = 5546) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55460 a prime number?
No. 55460 = × 5 × 47 × 59, so it is divisible by 2.
What are the factors of 55460?
1, 2, 4, 5, 10, 20, 47, 59, 94, 118, 188, 235, 236, 295, 470, 590, 940, 1180, 2773, 5546, 11092, 13865, 27730, 55460.
What is 55460 in binary?
1101100010100100 (hexadecimal D8A4, octal 154244).
What is the square root of 55460?
About 235.4995, exactly 2√13865.
Is 55460 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 55460?
55460 is a Harshad number: divisible by its digit sum 20.