The number 50236
50236 is a composite number with 12 divisors. Its prime factorisation is × 19 × 661. Divisors (12): 1, 2, 4, 19, 38, 76, 661, 1322, 2644, 12559, 25118, 50236.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50236 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50236 is composite. Its prime factorisation is
- 3
The divisors add up to 92680; without 50236 itself that is 42444, so 50236 is deficient (42444 is less than 50236). Euler's totient φ(50236) = 23760 numbers up to 50236 share no factor with it.
- 4
The digits of 50236 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50236 = 2^{2} \times 19 \times 661 \]50236 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 92680 |
| Euler totient φ(n) | 23760 |
| Square | 2523655696 |
| Cube | 126778367544256 |
| Square root | 224.133889 (= 2√12559) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0236 × |
50236 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand two hundred and thirty-six |
| Binary (base 2) | 1100010000111100 |
| Octal (base 8) | 142074 |
| Hexadecimal (base 16) | C43C |
| Base 3 | 2112220121 |
| As time | 50236 seconds = 13 h 57 min 16 s |
Is 50236 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50236 ÷ 2 = 25118) | 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 (50236 ÷ 4 = 12559) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 50236 a prime number?
No. 50236 = × 19 × 661, so it is divisible by 2.
What are the factors of 50236?
1, 2, 4, 19, 38, 76, 661, 1322, 2644, 12559, 25118, 50236.
What is 50236 in binary?
1100010000111100 (hexadecimal C43C, octal 142074).
What is the square root of 50236?
About 224.1339, exactly 2√12559.
Is 50236 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 50236?
It is a composite number with 12 divisors.