The number 50564
50564 is a composite number with 6 divisors. Its prime factorisation is × 12641. Divisors (6): 1, 2, 4, 12641, 25282, 50564.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50564 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50564 is composite. Its prime factorisation is
- 3
The divisors add up to 88494; without 50564 itself that is 37930, so 50564 is deficient (37930 is less than 50564). Euler's totient φ(50564) = 25280 numbers up to 50564 share no factor with it.
- 4
The digits of 50564 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50564 = 2^{2} \times 12641 \]50564 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 88494 |
| Euler totient φ(n) | 25280 |
| Square | 2556718096 |
| Cube | 129277893806144 |
| Square root | 224.864404 (= 2√12641) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.0564 × |
50564 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and sixty-four |
| Binary (base 2) | 1100010110000100 |
| Octal (base 8) | 142604 |
| Hexadecimal (base 16) | C584 |
| Base 3 | 2120100202 |
| As time | 50564 seconds = 14 h 2 min 44 s |
Is 50564 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50564 ÷ 2 = 25282) | 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 (50564 ÷ 4 = 12641) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 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 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50564 a prime number?
No. 50564 = × 12641, so it is divisible by 2.
What are the factors of 50564?
1, 2, 4, 12641, 25282, 50564.
What is 50564 in binary?
1100010110000100 (hexadecimal C584, octal 142604).
What is the square root of 50564?
About 224.8644, exactly 2√12641.
Is 50564 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 50564?
It is a composite number with 6 divisors.