The number 50562
50562 is a composite number with 18 divisors. Its prime factorisation is 2 × × . Divisors (18): 1, 2, 3, 6, 9, 18, 53, 106, 159, 318, 477, 954, 2809, 5618, 8427, 16854 … 50562.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50562: a Harshad number: divisible by its digit sum 18.
- 2
50562 is composite. Its prime factorisation is
- 3
The divisors add up to 111657; without 50562 itself that is 61095, so 50562 is abundant (61095 is more than 50562). Euler's totient φ(50562) = 16536 numbers up to 50562 share no factor with it.
- 4
The digits of 50562 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50562 = 2 \times 3^{2} \times 53^{2} \]50562 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 111657 |
| Euler totient φ(n) | 16536 |
| Square | 2556515844 |
| Cube | 129262554104328 |
| Square root | 224.859956 (= 159√2) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.0562 × |
50562 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and sixty-two |
| Binary (base 2) | 1100010110000010 |
| Octal (base 8) | 142602 |
| Hexadecimal (base 16) | C582 |
| Base 3 | 2120100200 |
| As time | 50562 seconds = 14 h 2 min 42 s |
Is 50562 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50562 ÷ 2 = 25281) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50562 ÷ 3 = 16854) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (50562 ÷ 6 = 8427) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (50562 ÷ 9 = 5618) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50562 a prime number?
No. 50562 = 2 × × , so it is divisible by 2.
What are the factors of 50562?
1, 2, 3, 6, 9, 18, 53, 106, 159, 318, 477, 954, 2809, 5618, 8427, 16854, 25281, 50562.
What is 50562 in binary?
1100010110000010 (hexadecimal C582, octal 142602).
What is the square root of 50562?
About 224.8600, exactly 159√2.
Is 50562 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 50562?
50562 is a Harshad number: divisible by its digit sum 18.