The number 50214
50214 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 8369. Divisors (8): 1, 2, 3, 6, 8369, 16738, 25107, 50214.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50214 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50214 is composite. Its prime factorisation is
- 3
The divisors add up to 100440; without 50214 itself that is 50226, so 50214 is abundant (50226 is more than 50214). Euler's totient φ(50214) = 16736 numbers up to 50214 share no factor with it.
- 4
The digits of 50214 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50214 = 2 \times 3 \times 8369 \]
50214 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 100440 |
| Euler totient φ(n) | 16736 |
| Square | 2521445796 |
| Cube | 126611879200344 |
| Square root | 224.084805 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0214 × |
50214 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand two hundred and fourteen |
| Binary (base 2) | 1100010000100110 |
| Octal (base 8) | 142046 |
| Hexadecimal (base 16) | C426 |
| Base 3 | 2112212210 |
| As time | 50214 seconds = 13 h 56 min 54 s |
Is 50214 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50214 ÷ 2 = 25107) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50214 ÷ 3 = 16738) | 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 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (50214 ÷ 6 = 8369) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 50214 a prime number?
No. 50214 = 2 × 3 × 8369, so it is divisible by 2.
What are the factors of 50214?
1, 2, 3, 6, 8369, 16738, 25107, 50214.
What is 50214 in binary?
1100010000100110 (hexadecimal C426, octal 142046).
What is the square root of 50214?
About 224.0848.
Is 50214 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 50214?
It is a composite number with 8 divisors.