The number 50565
50565 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 3371. Divisors (8): 1, 3, 5, 15, 3371, 10113, 16855, 50565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50565 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50565 is composite. Its prime factorisation is
- 3
The divisors add up to 80928; without 50565 itself that is 30363, so 50565 is deficient (30363 is less than 50565). Euler's totient φ(50565) = 26960 numbers up to 50565 share no factor with it.
- 4
The digits of 50565 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50565 = 3 \times 5 \times 3371 \]
50565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 80928 |
| Euler totient φ(n) | 26960 |
| Square | 2556819225 |
| Cube | 129285564112125 |
| Square root | 224.866627 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.0565 × |
50565 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and sixty-five |
| Binary (base 2) | 1100010110000101 |
| Octal (base 8) | 142605 |
| Hexadecimal (base 16) | C585 |
| Base 3 | 2120100210 |
| As time | 50565 seconds = 14 h 2 min 45 s |
Is 50565 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 | Yes (50565 ÷ 3 = 16855) | 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 | Yes (50565 ÷ 5 = 10113) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 | No (remainder 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50565 a prime number?
No. 50565 = 3 × 5 × 3371, so it is divisible by 3.
What are the factors of 50565?
1, 3, 5, 15, 3371, 10113, 16855, 50565.
What is 50565 in binary?
1100010110000101 (hexadecimal C585, octal 142605).
What is the square root of 50565?
About 224.8666.
Is 50565 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 50565?
It is a composite number with 8 divisors.