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