The number 50942
50942 is a composite number with 4 divisors. Its prime factorisation is 2 × 25471. Divisors (4): 1, 2, 25471, 50942.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50942: a semiprime: 2 × 25471, the product of two primes.
- 2
50942 is composite. Its prime factorisation is
- 3
The divisors add up to 76416; without 50942 itself that is 25474, so 50942 is deficient (25474 is less than 50942). Euler's totient φ(50942) = 25470 numbers up to 50942 share no factor with it.
- 4
The digits of 50942 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50942 = 2 \times 25471 \]
50942 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 76416 |
| Euler totient φ(n) | 25470 |
| Square | 2595087364 |
| Cube | 132198940496888 |
| Square root | 225.703345 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.0942 × |
50942 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and forty-two |
| Binary (base 2) | 1100011011111110 |
| Octal (base 8) | 143376 |
| Hexadecimal (base 16) | C6FE |
| Base 3 | 2120212202 |
| As time | 50942 seconds = 14 h 9 min 2 s |
Is 50942 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50942 ÷ 2 = 25471) | 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 3) | 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 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 1) | 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 50942 a prime number?
No. 50942 = 2 × 25471, so it is divisible by 2.
What are the factors of 50942?
1, 2, 25471, 50942.
What is 50942 in binary?
1100011011111110 (hexadecimal C6FE, octal 143376).
What is the square root of 50942?
About 225.7033.
Is 50942 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 50942?
50942 is a semiprime: 2 × 25471, the product of two primes.