The number 50765
50765 is a composite number with 16 divisors. Its prime factorisation is 5 × 11 × 13 × 71. Divisors (16): 1, 5, 11, 13, 55, 65, 71, 143, 355, 715, 781, 923, 3905, 4615, 10153, 50765.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50765 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50765 is composite. Its prime factorisation is
- 3
The divisors add up to 72576; without 50765 itself that is 21811, so 50765 is deficient (21811 is less than 50765). Euler's totient φ(50765) = 33600 numbers up to 50765 share no factor with it.
- 4
The digits of 50765 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50765 = 5 \times 11 \times 13 \times 71 \]
50765 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 72576 |
| Euler totient φ(n) | 33600 |
| Square | 2577085225 |
| Cube | 130825731447125 |
| Square root | 225.310896 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 83 |
| Scientific notation | 5.0765 × |
50765 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand seven hundred and sixty-five |
| Binary (base 2) | 1100011001001101 |
| Octal (base 8) | 143115 |
| Hexadecimal (base 16) | C64D |
| Base 3 | 2120122012 |
| As time | 50765 seconds = 14 h 6 min 5 s |
Is 50765 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 | Yes (50765 ÷ 5 = 10153) | 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 | No (remainder 1) | 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 5) | 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 | Yes (50765 ÷ 11 = 4615) | 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 50765 a prime number?
No. 50765 = 5 × 11 × 13 × 71, so it is divisible by 5.
What are the factors of 50765?
1, 5, 11, 13, 55, 65, 71, 143, 355, 715, 781, 923, 3905, 4615, 10153, 50765.
What is 50765 in binary?
1100011001001101 (hexadecimal C64D, octal 143115).
What is the square root of 50765?
About 225.3109.
Is 50765 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 50765?
It is a composite number with 16 divisors.