The number 50561
50561 is a composite number with 8 divisors. Its prime factorisation is 7 × 31 × 233. Divisors (8): 1, 7, 31, 217, 233, 1631, 7223, 50561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50561 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50561 is composite. Its prime factorisation is
- 3
The divisors add up to 59904; without 50561 itself that is 9343, so 50561 is deficient (9343 is less than 50561). Euler's totient φ(50561) = 41760 numbers up to 50561 share no factor with it.
- 4
The digits of 50561 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50561 = 7 \times 31 \times 233 \]
50561 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 59904 |
| Euler totient φ(n) | 41760 |
| Square | 2556414721 |
| Cube | 129254884708481 |
| Square root | 224.857733 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.0561 × |
50561 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and sixty-one |
| Binary (base 2) | 1100010110000001 |
| Octal (base 8) | 142601 |
| Hexadecimal (base 16) | C581 |
| Base 3 | 2120100122 |
| As time | 50561 seconds = 14 h 2 min 41 s |
Is 50561 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 | No (remainder 1) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (50561 ÷ 7 = 7223) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50561 a prime number?
No. 50561 = 7 × 31 × 233, so it is divisible by 7.
What are the factors of 50561?
1, 7, 31, 217, 233, 1631, 7223, 50561.
What is 50561 in binary?
1100010110000001 (hexadecimal C581, octal 142601).
What is the square root of 50561?
About 224.8577.
Is 50561 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 50561?
It is a composite number with 8 divisors.