The number 13605
13605 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 907. Divisors (8): 1, 3, 5, 15, 907, 2721, 4535, 13605.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13605: a Harshad number: divisible by its digit sum 15.
- 2
13605 is composite. Its prime factorisation is
- 3
The divisors add up to 21792; without 13605 itself that is 8187, so 13605 is deficient (8187 is less than 13605). Euler's totient φ(13605) = 7248 numbers up to 13605 share no factor with it.
- 4
The digits of 13605 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13605 = 3 \times 5 \times 907 \]
13605 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 21792 |
| Euler totient φ(n) | 7248 |
| Square | 185096025 |
| Cube | 2518231420125 |
| Square root | 116.640473 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.3605 × |
13605 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand six hundred and five |
| Binary (base 2) | 11010100100101 |
| Octal (base 8) | 32445 |
| Hexadecimal (base 16) | 3525 |
| Base 3 | 200122220 |
| As time | 13605 seconds = 3 h 46 min 45 s |
Is 13605 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 (13605 ÷ 3 = 4535) | 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 (13605 ÷ 5 = 2721) | 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 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 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 9) | 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 13605 a prime number?
No. 13605 = 3 × 5 × 907, so it is divisible by 3.
What are the factors of 13605?
1, 3, 5, 15, 907, 2721, 4535, 13605.
What is 13605 in binary?
11010100100101 (hexadecimal 3525, octal 32445).
What is the square root of 13605?
About 116.6405.
Is 13605 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 13605?
13605 is a Harshad number: divisible by its digit sum 15.