The number 50238
50238 is a composite number with 12 divisors. Its prime factorisation is 2 × × 2791. Divisors (12): 1, 2, 3, 6, 9, 18, 2791, 5582, 8373, 16746, 25119, 50238.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50238: a Harshad number: divisible by its digit sum 18.
- 2
50238 is composite. Its prime factorisation is
- 3
The divisors add up to 108888; without 50238 itself that is 58650, so 50238 is abundant (58650 is more than 50238). Euler's totient φ(50238) = 16740 numbers up to 50238 share no factor with it.
- 4
The digits of 50238 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50238 = 2 \times 3^{2} \times 2791 \]50238 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 108888 |
| Euler totient φ(n) | 16740 |
| Square | 2523856644 |
| Cube | 126793510081272 |
| Square root | 224.138350 (= 3√5582) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.0238 × |
50238 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand two hundred and thirty-eight |
| Binary (base 2) | 1100010000111110 |
| Octal (base 8) | 142076 |
| Hexadecimal (base 16) | C43E |
| Base 3 | 2112220200 |
| As time | 50238 seconds = 13 h 57 min 18 s |
Is 50238 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50238 ÷ 2 = 25119) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50238 ÷ 3 = 16746) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (50238 ÷ 6 = 8373) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 | Yes (50238 ÷ 9 = 5582) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 50238 a prime number?
No. 50238 = 2 × × 2791, so it is divisible by 2.
What are the factors of 50238?
1, 2, 3, 6, 9, 18, 2791, 5582, 8373, 16746, 25119, 50238.
What is 50238 in binary?
1100010000111110 (hexadecimal C43E, octal 142076).
What is the square root of 50238?
About 224.1384, exactly 3√5582.
Is 50238 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 50238?
50238 is a Harshad number: divisible by its digit sum 18.