The number 50042
50042 is a composite number with 8 divisors. Its prime factorisation is 2 × 131 × 191. Divisors (8): 1, 2, 131, 191, 262, 382, 25021, 50042.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50042 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50042 is composite. Its prime factorisation is
- 3
The divisors add up to 76032; without 50042 itself that is 25990, so 50042 is deficient (25990 is less than 50042). Euler's totient φ(50042) = 24700 numbers up to 50042 share no factor with it.
- 4
The digits of 50042 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50042 = 2 \times 131 \times 191 \]
50042 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 76032 |
| Euler totient φ(n) | 24700 |
| Square | 2504201764 |
| Cube | 125315264674088 |
| Square root | 223.700693 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 114 |
| Scientific notation | 5.0042 × |
50042 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and forty-two |
| Binary (base 2) | 1100001101111010 |
| Octal (base 8) | 141572 |
| Hexadecimal (base 16) | C37A |
| Base 3 | 2112122102 |
| As time | 50042 seconds = 13 h 54 min 2 s |
Is 50042 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50042 ÷ 2 = 25021) | 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 2) | 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 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 3) | 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 50042 a prime number?
No. 50042 = 2 × 131 × 191, so it is divisible by 2.
What are the factors of 50042?
1, 2, 131, 191, 262, 382, 25021, 50042.
What is 50042 in binary?
1100001101111010 (hexadecimal C37A, octal 141572).
What is the square root of 50042?
About 223.7007.
Is 50042 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 50042?
It is a composite number with 8 divisors.