The number 53558
53558 is a composite number with 8 divisors. Its prime factorisation is 2 × 61 × 439. Divisors (8): 1, 2, 61, 122, 439, 878, 26779, 53558.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53558 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53558 is composite. Its prime factorisation is
- 3
The divisors add up to 81840; without 53558 itself that is 28282, so 53558 is deficient (28282 is less than 53558). Euler's totient φ(53558) = 26280 numbers up to 53558 share no factor with it.
- 4
The digits of 53558 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53558 = 2 \times 61 \times 439 \]
53558 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 81840 |
| Euler totient φ(n) | 26280 |
| Square | 2868459364 |
| Cube | 153628946617112 |
| Square root | 231.426014 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.3558 × |
53558 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand five hundred and fifty-eight |
| Binary (base 2) | 1101000100110110 |
| Octal (base 8) | 150466 |
| Hexadecimal (base 16) | D136 |
| Base 3 | 2201110122 |
| As time | 53558 seconds = 14 h 52 min 38 s |
Is 53558 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53558 ÷ 2 = 26779) | 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 | No (remainder 3) | 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 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 53558 a prime number?
No. 53558 = 2 × 61 × 439, so it is divisible by 2.
What are the factors of 53558?
1, 2, 61, 122, 439, 878, 26779, 53558.
What is 53558 in binary?
1101000100110110 (hexadecimal D136, octal 150466).
What is the square root of 53558?
About 231.4260.
Is 53558 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 53558?
It is a composite number with 8 divisors.