The number 50212
50212 is a composite number with 6 divisors. Its prime factorisation is × 12553. Divisors (6): 1, 2, 4, 12553, 25106, 50212.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50212 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50212 is composite. Its prime factorisation is
- 3
The divisors add up to 87878; without 50212 itself that is 37666, so 50212 is deficient (37666 is less than 50212). Euler's totient φ(50212) = 25104 numbers up to 50212 share no factor with it.
- 4
The digits of 50212 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50212 = 2^{2} \times 12553 \]50212 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 87878 |
| Euler totient φ(n) | 25104 |
| Square | 2521244944 |
| Cube | 126596751128128 |
| Square root | 224.080343 (= 2√12553) |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0212 × |
50212 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand two hundred and twelve |
| Binary (base 2) | 1100010000100100 |
| Octal (base 8) | 142044 |
| Hexadecimal (base 16) | C424 |
| Base 3 | 2112212201 |
| As time | 50212 seconds = 13 h 56 min 52 s |
Is 50212 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50212 ÷ 2 = 25106) | 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 | Yes (50212 ÷ 4 = 12553) | 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 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50212 a prime number?
No. 50212 = × 12553, so it is divisible by 2.
What are the factors of 50212?
1, 2, 4, 12553, 25106, 50212.
What is 50212 in binary?
1100010000100100 (hexadecimal C424, octal 142044).
What is the square root of 50212?
About 224.0803, exactly 2√12553.
Is 50212 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 50212?
It is a composite number with 6 divisors.