The number 50558
50558 is a composite number with 8 divisors. Its prime factorisation is 2 × 17 × 1487. Divisors (8): 1, 2, 17, 34, 1487, 2974, 25279, 50558.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50558: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
50558 is composite. Its prime factorisation is
- 3
The divisors add up to 80352; without 50558 itself that is 29794, so 50558 is deficient (29794 is less than 50558). Euler's totient φ(50558) = 23776 numbers up to 50558 share no factor with it.
- 4
The digits of 50558 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50558 = 2 \times 17 \times 1487 \]
50558 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 80352 |
| Euler totient φ(n) | 23776 |
| Square | 2556111364 |
| Cube | 129231878341112 |
| Square root | 224.851062 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.0558 × |
50558 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and fifty-eight |
| Binary (base 2) | 1100010101111110 |
| Octal (base 8) | 142576 |
| Hexadecimal (base 16) | C57E |
| Base 3 | 2120100112 |
| As time | 50558 seconds = 14 h 2 min 38 s |
Is 50558 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50558 ÷ 2 = 25279) | 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 4) | 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 5) | 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 2) | 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 50558 a prime number?
No. 50558 = 2 × 17 × 1487, so it is divisible by 2.
What are the factors of 50558?
1, 2, 17, 34, 1487, 2974, 25279, 50558.
What is 50558 in binary?
1100010101111110 (hexadecimal C57E, octal 142576).
What is the square root of 50558?
About 224.8511.
Is 50558 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 50558?
50558 is a happy number: repeatedly adding the squares of its digits reaches 1.