The number 50936
50936 is a composite number with 8 divisors. Its prime factorisation is × 6367. Divisors (8): 1, 2, 4, 8, 6367, 12734, 25468, 50936.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50936 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50936 is composite. Its prime factorisation is
- 3
The divisors add up to 95520; without 50936 itself that is 44584, so 50936 is deficient (44584 is less than 50936). Euler's totient φ(50936) = 25464 numbers up to 50936 share no factor with it.
- 4
The digits of 50936 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50936 = 2^{3} \times 6367 \]50936 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 95520 |
| Euler totient φ(n) | 25464 |
| Square | 2594476096 |
| Cube | 132152234425856 |
| Square root | 225.690053 (= 2√12734) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0936 × |
50936 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and thirty-six |
| Binary (base 2) | 1100011011111000 |
| Octal (base 8) | 143370 |
| Hexadecimal (base 16) | C6F8 |
| Base 3 | 2120212112 |
| As time | 50936 seconds = 14 h 8 min 56 s |
Is 50936 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50936 ÷ 2 = 25468) | 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 | Yes (50936 ÷ 4 = 12734) | 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 2) | 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 | Yes (50936 ÷ 8 = 6367) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50936 a prime number?
No. 50936 = × 6367, so it is divisible by 2.
What are the factors of 50936?
1, 2, 4, 8, 6367, 12734, 25468, 50936.
What is 50936 in binary?
1100011011111000 (hexadecimal C6F8, octal 143370).
What is the square root of 50936?
About 225.6901, exactly 2√12734.
Is 50936 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 50936?
It is a composite number with 8 divisors.