The number 50063
50063 is a composite number with 4 divisors. Its prime factorisation is 13 × 3851. Divisors (4): 1, 13, 3851, 50063.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50063: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 3851, the product of two primes.
- 2
50063 is composite. Its prime factorisation is
- 3
The divisors add up to 53928; without 50063 itself that is 3865, so 50063 is deficient (3865 is less than 50063). Euler's totient φ(50063) = 46200 numbers up to 50063 share no factor with it.
- 4
The digits of 50063 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50063 = 13 \times 3851 \]
50063 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 53928 |
| Euler totient φ(n) | 46200 |
| Square | 2506303969 |
| Cube | 125473095600047 |
| Square root | 223.747626 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 114 |
| Scientific notation | 5.0063 × |
50063 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and sixty-three |
| Binary (base 2) | 1100001110001111 |
| Octal (base 8) | 141617 |
| Hexadecimal (base 16) | C38F |
| Base 3 | 2112200012 |
| As time | 50063 seconds = 13 h 54 min 23 s |
Is 50063 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 7) | 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 3) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50063 a prime number?
No. 50063 = 13 × 3851, so it is divisible by 13.
What are the factors of 50063?
1, 13, 3851, 50063.
What is 50063 in binary?
1100001110001111 (hexadecimal C38F, octal 141617).
What is the square root of 50063?
About 223.7476.
Is 50063 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 50063?
50063 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 3851, the product of two primes.