The number 11565
11565 is a binary palindrome (10110100101101). Its prime factorisation is × 5 × 257. Divisors (12): 1, 3, 5, 9, 15, 45, 257, 771, 1285, 2313, 3855, 11565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11565: a binary palindrome (10110100101101).
- 2
11565 is composite. Its prime factorisation is
- 3
The divisors add up to 20124; without 11565 itself that is 8559, so 11565 is deficient (8559 is less than 11565). Euler's totient φ(11565) = 6144 numbers up to 11565 share no factor with it.
- 4
The digits of 11565 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 50 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11565 = 3^{2} \times 5 \times 257 \]11565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 20124 |
| Euler totient φ(n) | 6144 |
| Square | 133749225 |
| Cube | 1546809787125 |
| Square root | 107.540690 (= 3√1285) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 50 |
| Scientific notation | 1.1565 × |
11565 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand five hundred and sixty-five |
| Binary (base 2) | 10110100101101 |
| Octal (base 8) | 26455 |
| Hexadecimal (base 16) | 2D2D |
| Base 3 | 120212100 |
| As time | 11565 seconds = 3 h 12 min 45 s |
Is 11565 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 (11565 ÷ 3 = 3855) | 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 (11565 ÷ 5 = 2313) | 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 | Yes (11565 ÷ 9 = 1285) | 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 4) | 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 11565 a prime number?
No. 11565 = × 5 × 257, so it is divisible by 3.
What are the factors of 11565?
1, 3, 5, 9, 15, 45, 257, 771, 1285, 2313, 3855, 11565.
What is 11565 in binary?
10110100101101 (hexadecimal 2D2D, octal 26455).
What is the square root of 11565?
About 107.5407, exactly 3√1285.
Is 11565 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 11565?
11565 is a binary palindrome (10110100101101).