The number 50536
50536 is a composite number with 8 divisors. Its prime factorisation is × 6317. Divisors (8): 1, 2, 4, 8, 6317, 12634, 25268, 50536.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50536 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50536 is composite. Its prime factorisation is
- 3
The divisors add up to 94770; without 50536 itself that is 44234, so 50536 is deficient (44234 is less than 50536). Euler's totient φ(50536) = 25264 numbers up to 50536 share no factor with it.
- 4
The digits of 50536 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50536 = 2^{3} \times 6317 \]50536 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 94770 |
| Euler totient φ(n) | 25264 |
| Square | 2553887296 |
| Cube | 129063248390656 |
| Square root | 224.802135 (= 2√12634) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.0536 × |
50536 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and thirty-six |
| Binary (base 2) | 1100010101101000 |
| Octal (base 8) | 142550 |
| Hexadecimal (base 16) | C568 |
| Base 3 | 2120022201 |
| As time | 50536 seconds = 14 h 2 min 16 s |
Is 50536 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50536 ÷ 2 = 25268) | 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 (50536 ÷ 4 = 12634) | 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 3) | 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 (50536 ÷ 8 = 6317) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 2) | 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 50536 a prime number?
No. 50536 = × 6317, so it is divisible by 2.
What are the factors of 50536?
1, 2, 4, 8, 6317, 12634, 25268, 50536.
What is 50536 in binary?
1100010101101000 (hexadecimal C568, octal 142550).
What is the square root of 50536?
About 224.8021, exactly 2√12634.
Is 50536 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 50536?
It is a composite number with 8 divisors.