The number 50563
50563 is a composite number with 4 divisors. Its prime factorisation is 59 × 857. Divisors (4): 1, 59, 857, 50563.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50563: a semiprime: 59 × 857, the product of two primes.
- 2
50563 is composite. Its prime factorisation is
- 3
The divisors add up to 51480; without 50563 itself that is 917, so 50563 is deficient (917 is less than 50563). Euler's totient φ(50563) = 49648 numbers up to 50563 share no factor with it.
- 4
The digits of 50563 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50563 = 59 \times 857 \]
50563 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 51480 |
| Euler totient φ(n) | 49648 |
| Square | 2556616969 |
| Cube | 129270223803547 |
| Square root | 224.862180 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.0563 × |
50563 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and sixty-three |
| Binary (base 2) | 1100010110000011 |
| Octal (base 8) | 142603 |
| Hexadecimal (base 16) | C583 |
| Base 3 | 2120100201 |
| As time | 50563 seconds = 14 h 2 min 43 s |
Is 50563 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 3) | 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 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50563 a prime number?
No. 50563 = 59 × 857, so it is divisible by 59.
What are the factors of 50563?
1, 59, 857, 50563.
What is 50563 in binary?
1100010110000011 (hexadecimal C583, octal 142603).
What is the square root of 50563?
About 224.8622.
Is 50563 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 50563?
50563 is a semiprime: 59 × 857, the product of two primes.