The number 10565
10565 is a composite number with 4 divisors. Its prime factorisation is 5 × 2113. Divisors (4): 1, 5, 2113, 10565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10565: a semiprime: 5 × 2113, the product of two primes.
- 2
10565 is composite. Its prime factorisation is
- 3
The divisors add up to 12684; without 10565 itself that is 2119, so 10565 is deficient (2119 is less than 10565). Euler's totient φ(10565) = 8448 numbers up to 10565 share no factor with it.
- 4
The digits of 10565 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 104 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10565 = 5 \times 2113 \]
10565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 12684 |
| Euler totient φ(n) | 8448 |
| Square | 111619225 |
| Cube | 1179257112125 |
| Square root | 102.786186 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 104 |
| Scientific notation | 1.0565 × |
10565 in other forms
| Form | Value |
|---|---|
| In words | ten thousand five hundred and sixty-five |
| Binary (base 2) | 10100101000101 |
| Octal (base 8) | 24505 |
| Hexadecimal (base 16) | 2945 |
| Base 3 | 112111022 |
| As time | 10565 seconds = 2 h 56 min 5 s |
Is 10565 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 (10565 ÷ 5 = 2113) | 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 2) | 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 8) | 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 5) | 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 10565 a prime number?
No. 10565 = 5 × 2113, so it is divisible by 5.
What are the factors of 10565?
1, 5, 2113, 10565.
What is 10565 in binary?
10100101000101 (hexadecimal 2945, octal 24505).
What is the square root of 10565?
About 102.7862.
Is 10565 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 10565?
10565 is a semiprime: 5 × 2113, the product of two primes.