The number 50211
50211 is a binary palindrome (1100010000100011). Its prime factorisation is × 7 × 797. Divisors (12): 1, 3, 7, 9, 21, 63, 797, 2391, 5579, 7173, 16737, 50211.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50211: a binary palindrome (1100010000100011); a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.
- 2
50211 is composite. Its prime factorisation is
- 3
The divisors add up to 82992; without 50211 itself that is 32781, so 50211 is deficient (32781 is less than 50211). Euler's totient φ(50211) = 28656 numbers up to 50211 share no factor with it.
- 4
The digits of 50211 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50211 = 3^{2} \times 7 \times 797 \]50211 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 82992 |
| Euler totient φ(n) | 28656 |
| Square | 2521144521 |
| Cube | 126589187543931 |
| Square root | 224.078111 (= 3√5579) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 39 |
| Scientific notation | 5.0211 × |
50211 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand two hundred and eleven |
| Binary (base 2) | 1100010000100011 |
| Octal (base 8) | 142043 |
| Hexadecimal (base 16) | C423 |
| Base 3 | 2112212200 |
| As time | 50211 seconds = 13 h 56 min 51 s |
Is 50211 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50211 ÷ 3 = 16737) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (50211 ÷ 7 = 7173) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (50211 ÷ 9 = 5579) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50211 a prime number?
No. 50211 = × 7 × 797, so it is divisible by 3.
What are the factors of 50211?
1, 3, 7, 9, 21, 63, 797, 2391, 5579, 7173, 16737, 50211.
What is 50211 in binary?
1100010000100011 (hexadecimal C423, octal 142043).
What is the square root of 50211?
About 224.0781, exactly 3√5579.
Is 50211 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 50211?
50211 is a binary palindrome (1100010000100011); a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.