The number 50062
50062 is a composite number with 4 divisors. Its prime factorisation is 2 × 25031. Divisors (4): 1, 2, 25031, 50062.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50062: a semiprime: 2 × 25031, the product of two primes.
- 2
50062 is composite. Its prime factorisation is
- 3
The divisors add up to 75096; without 50062 itself that is 25034, so 50062 is deficient (25034 is less than 50062). Euler's totient φ(50062) = 25030 numbers up to 50062 share no factor with it.
- 4
The digits of 50062 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50062 = 2 \times 25031 \]
50062 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 75096 |
| Euler totient φ(n) | 25030 |
| Square | 2506203844 |
| Cube | 125465576838328 |
| Square root | 223.745391 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 114 |
| Scientific notation | 5.0062 × |
50062 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and sixty-two |
| Binary (base 2) | 1100001110001110 |
| Octal (base 8) | 141616 |
| Hexadecimal (base 16) | C38E |
| Base 3 | 2112200011 |
| As time | 50062 seconds = 13 h 54 min 22 s |
Is 50062 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50062 ÷ 2 = 25031) | 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 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 | No (remainder 4) | 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 4) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50062 a prime number?
No. 50062 = 2 × 25031, so it is divisible by 2.
What are the factors of 50062?
1, 2, 25031, 50062.
What is 50062 in binary?
1100001110001110 (hexadecimal C38E, octal 141616).
What is the square root of 50062?
About 223.7454.
Is 50062 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 50062?
50062 is a semiprime: 2 × 25031, the product of two primes.