The number 50142
50142 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 61 × 137. Divisors (16): 1, 2, 3, 6, 61, 122, 137, 183, 274, 366, 411, 822, 8357, 16714, 25071, 50142.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50142 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50142 is composite. Its prime factorisation is
- 3
The divisors add up to 102672; without 50142 itself that is 52530, so 50142 is abundant (52530 is more than 50142). Euler's totient φ(50142) = 16320 numbers up to 50142 share no factor with it.
- 4
The digits of 50142 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 88 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50142 = 2 \times 3 \times 61 \times 137 \]
50142 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 102672 |
| Euler totient φ(n) | 16320 |
| Square | 2514220164 |
| Cube | 126068027463288 |
| Square root | 223.924094 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 88 |
| Scientific notation | 5.0142 × |
50142 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand one hundred and forty-two |
| Binary (base 2) | 1100001111011110 |
| Octal (base 8) | 141736 |
| Hexadecimal (base 16) | C3DE |
| Base 3 | 2112210010 |
| As time | 50142 seconds = 13 h 55 min 42 s |
Is 50142 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50142 ÷ 2 = 25071) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50142 ÷ 3 = 16714) | 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 | Yes (50142 ÷ 6 = 8357) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 3) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50142 a prime number?
No. 50142 = 2 × 3 × 61 × 137, so it is divisible by 2.
What are the factors of 50142?
1, 2, 3, 6, 61, 122, 137, 183, 274, 366, 411, 822, 8357, 16714, 25071, 50142.
What is 50142 in binary?
1100001111011110 (hexadecimal C3DE, octal 141736).
What is the square root of 50142?
About 223.9241.
Is 50142 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 50142?
It is a composite number with 16 divisors.