The number 50213
50213 is a composite number with 4 divisors. Its prime factorisation is 149 × 337. Divisors (4): 1, 149, 337, 50213.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50213: a semiprime: 149 × 337, the product of two primes.
- 2
50213 is composite. Its prime factorisation is
- 3
The divisors add up to 50700; without 50213 itself that is 487, so 50213 is deficient (487 is less than 50213). Euler's totient φ(50213) = 49728 numbers up to 50213 share no factor with it.
- 4
The digits of 50213 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50213 = 149 \times 337 \]
50213 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 50700 |
| Euler totient φ(n) | 49728 |
| Square | 2521345369 |
| Cube | 126604315013597 |
| Square root | 224.082574 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0213 × |
50213 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand two hundred and thirteen |
| Binary (base 2) | 1100010000100101 |
| Octal (base 8) | 142045 |
| Hexadecimal (base 16) | C425 |
| Base 3 | 2112212202 |
| As time | 50213 seconds = 13 h 56 min 53 s |
Is 50213 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 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 5) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50213 a prime number?
No. 50213 = 149 × 337, so it is divisible by 149.
What are the factors of 50213?
1, 149, 337, 50213.
What is 50213 in binary?
1100010000100101 (hexadecimal C425, octal 142045).
What is the square root of 50213?
About 224.0826.
Is 50213 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 50213?
50213 is a semiprime: 149 × 337, the product of two primes.