The number 5765
5765 is a composite number with 4 divisors. Its prime factorisation is 5 × 1153. Divisors (4): 1, 5, 1153, 5765.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5765: a semiprime: 5 × 1153, the product of two primes.
- 2
5765 is composite. Its prime factorisation is
- 3
The divisors add up to 6924; without 5765 itself that is 1159, so 5765 is deficient (1159 is less than 5765). Euler's totient φ(5765) = 4608 numbers up to 5765 share no factor with it.
- 4
The digits of 5765 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 142 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5765 = 5 \times 1153 \]
5765 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 6924 |
| Euler totient φ(n) | 4608 |
| Square | 33235225 |
| Cube | 191601072125 |
| Square root | 75.927597 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 142 |
| Scientific notation | 5.765 × |
5765 in other forms
| Form | Value |
|---|---|
| In words | five thousand seven hundred and sixty-five |
| Binary (base 2) | 1011010000101 |
| Octal (base 8) | 13205 |
| Hexadecimal (base 16) | 1685 |
| Base 3 | 21220112 |
| As time | 5765 seconds = 1 h 36 min 5 s |
Is 5765 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 (5765 ÷ 5 = 1153) | 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 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 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 | No (remainder 1) | 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 5765 a prime number?
No. 5765 = 5 × 1153, so it is divisible by 5.
What are the factors of 5765?
1, 5, 1153, 5765.
What is 5765 in binary?
1011010000101 (hexadecimal 1685, octal 13205).
What is the square root of 5765?
About 75.9276.
Is 5765 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 5765?
5765 is a semiprime: 5 × 1153, the product of two primes.