The number 15765
15765 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 1051. Divisors (8): 1, 3, 5, 15, 1051, 3153, 5255, 15765.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15765 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15765 is composite. Its prime factorisation is
- 3
The divisors add up to 25248; without 15765 itself that is 9483, so 15765 is deficient (9483 is less than 15765). Euler's totient φ(15765) = 8400 numbers up to 15765 share no factor with it.
- 4
The digits of 15765 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 27 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15765 = 3 \times 5 \times 1051 \]
15765 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 25248 |
| Euler totient φ(n) | 8400 |
| Square | 248535225 |
| Cube | 3918157822125 |
| Square root | 125.558751 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 27 |
| Scientific notation | 1.5765 × |
15765 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand seven hundred and sixty-five |
| Binary (base 2) | 11110110010101 |
| Octal (base 8) | 36625 |
| Hexadecimal (base 16) | 3D95 |
| Base 3 | 210121220 |
| As time | 15765 seconds = 4 h 22 min 45 s |
Is 15765 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 (15765 ÷ 3 = 5255) | 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 (15765 ÷ 5 = 3153) | 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 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 6) | 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 2) | 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 15765 a prime number?
No. 15765 = 3 × 5 × 1051, so it is divisible by 3.
What are the factors of 15765?
1, 3, 5, 15, 1051, 3153, 5255, 15765.
What is 15765 in binary?
11110110010101 (hexadecimal 3D95, octal 36625).
What is the square root of 15765?
About 125.5588.
Is 15765 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 15765?
It is a composite number with 8 divisors.