The number 13565
13565 is a composite number with 4 divisors. Its prime factorisation is 5 × 2713. Divisors (4): 1, 5, 2713, 13565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13565: a semiprime: 5 × 2713, the product of two primes.
- 2
13565 is composite. Its prime factorisation is
- 3
The divisors add up to 16284; without 13565 itself that is 2719, so 13565 is deficient (2719 is less than 13565). Euler's totient φ(13565) = 10848 numbers up to 13565 share no factor with it.
- 4
The digits of 13565 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 182 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13565 = 5 \times 2713 \]
13565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16284 |
| Euler totient φ(n) | 10848 |
| Square | 184009225 |
| Cube | 2496085137125 |
| Square root | 116.468880 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 182 |
| Scientific notation | 1.3565 × |
13565 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand five hundred and sixty-five |
| Binary (base 2) | 11010011111101 |
| Octal (base 8) | 32375 |
| Hexadecimal (base 16) | 34FD |
| Base 3 | 200121102 |
| As time | 13565 seconds = 3 h 46 min 5 s |
Is 13565 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 (13565 ÷ 5 = 2713) | 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 6) | 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 2) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13565 a prime number?
No. 13565 = 5 × 2713, so it is divisible by 5.
What are the factors of 13565?
1, 5, 2713, 13565.
What is 13565 in binary?
11010011111101 (hexadecimal 34FD, octal 32375).
What is the square root of 13565?
About 116.4689.
Is 13565 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 13565?
13565 is a semiprime: 5 × 2713, the product of two primes.