The number 52558
52558 is a composite number with 8 divisors. Its prime factorisation is 2 × 11 × 2389. Divisors (8): 1, 2, 11, 22, 2389, 4778, 26279, 52558.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
52558 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
52558 is composite. Its prime factorisation is
- 3
The divisors add up to 86040; without 52558 itself that is 33482, so 52558 is deficient (33482 is less than 52558). Euler's totient φ(52558) = 23880 numbers up to 52558 share no factor with it.
- 4
The digits of 52558 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52558 = 2 \times 11 \times 2389 \]
52558 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 86040 |
| Euler totient φ(n) | 23880 |
| Square | 2762343364 |
| Cube | 145183242525112 |
| Square root | 229.255316 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.2558 × |
52558 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand five hundred and fifty-eight |
| Binary (base 2) | 1100110101001110 |
| Octal (base 8) | 146516 |
| Hexadecimal (base 16) | CD4E |
| Base 3 | 2200002121 |
| As time | 52558 seconds = 14 h 35 min 58 s |
Is 52558 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52558 ÷ 2 = 26279) | 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 | No (remainder 3) | 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 2) | 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 7) | 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 | Yes (52558 ÷ 11 = 4778) | 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 52558 a prime number?
No. 52558 = 2 × 11 × 2389, so it is divisible by 2.
What are the factors of 52558?
1, 2, 11, 22, 2389, 4778, 26279, 52558.
What is 52558 in binary?
1100110101001110 (hexadecimal CD4E, octal 146516).
What is the square root of 52558?
About 229.2553.
Is 52558 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 52558?
It is a composite number with 8 divisors.