The number 56558
56558 is a composite number with 4 divisors. Its prime factorisation is 2 × 28279. Divisors (4): 1, 2, 28279, 56558.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56558: a semiprime: 2 × 28279, the product of two primes.
- 2
56558 is composite. Its prime factorisation is
- 3
The divisors add up to 84840; without 56558 itself that is 28282, so 56558 is deficient (28282 is less than 56558). Euler's totient φ(56558) = 28278 numbers up to 56558 share no factor with it.
- 4
The digits of 56558 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 104 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56558 = 2 \times 28279 \]
56558 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 84840 |
| Euler totient φ(n) | 28278 |
| Square | 3198807364 |
| Cube | 180918146893112 |
| Square root | 237.819259 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 104 |
| Scientific notation | 5.6558 × |
56558 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand five hundred and fifty-eight |
| Binary (base 2) | 1101110011101110 |
| Octal (base 8) | 156356 |
| Hexadecimal (base 16) | DCEE |
| Base 3 | 2212120202 |
| As time | 56558 seconds = 15 h 42 min 38 s |
Is 56558 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56558 ÷ 2 = 28279) | 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 5) | 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 2) | 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 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 56558 a prime number?
No. 56558 = 2 × 28279, so it is divisible by 2.
What are the factors of 56558?
1, 2, 28279, 56558.
What is 56558 in binary?
1101110011101110 (hexadecimal DCEE, octal 156356).
What is the square root of 56558?
About 237.8193.
Is 56558 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 56558?
56558 is a semiprime: 2 × 28279, the product of two primes.