The number 50223
50223 is a composite number with 4 divisors. Its prime factorisation is 3 × 16741. Divisors (4): 1, 3, 16741, 50223.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50223: a semiprime: 3 × 16741, the product of two primes.
- 2
50223 is composite. Its prime factorisation is
- 3
The divisors add up to 66968; without 50223 itself that is 16745, so 50223 is deficient (16745 is less than 50223). Euler's totient φ(50223) = 33480 numbers up to 50223 share no factor with it.
- 4
The digits of 50223 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 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50223 = 3 \times 16741 \]
50223 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 66968 |
| Euler totient φ(n) | 33480 |
| Square | 2522349729 |
| Cube | 126679970439567 |
| Square root | 224.104886 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.0223 × |
50223 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand two hundred and twenty-three |
| Binary (base 2) | 1100010000101111 |
| Octal (base 8) | 142057 |
| Hexadecimal (base 16) | C42F |
| Base 3 | 2112220010 |
| As time | 50223 seconds = 13 h 57 min 3 s |
Is 50223 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 (50223 ÷ 3 = 16741) | 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 3) | 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 | No (remainder 5) | 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 7) | 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 3) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50223 a prime number?
No. 50223 = 3 × 16741, so it is divisible by 3.
What are the factors of 50223?
1, 3, 16741, 50223.
What is 50223 in binary?
1100010000101111 (hexadecimal C42F, octal 142057).
What is the square root of 50223?
About 224.1049.
Is 50223 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 50223?
50223 is a semiprime: 3 × 16741, the product of two primes.