The number 15605
15605 is a composite number with 4 divisors. Its prime factorisation is 5 × 3121. Divisors (4): 1, 5, 3121, 15605.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15605: a semiprime: 5 × 3121, the product of two primes.
- 2
15605 is composite. Its prime factorisation is
- 3
The divisors add up to 18732; without 15605 itself that is 3127, so 15605 is deficient (3127 is less than 15605). Euler's totient φ(15605) = 12480 numbers up to 15605 share no factor with it.
- 4
The digits of 15605 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 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15605 = 5 \times 3121 \]
15605 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 18732 |
| Euler totient φ(n) | 12480 |
| Square | 243516025 |
| Cube | 3800067570125 |
| Square root | 124.919974 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 146 |
| Scientific notation | 1.5605 × |
15605 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand six hundred and five |
| Binary (base 2) | 11110011110101 |
| Octal (base 8) | 36365 |
| Hexadecimal (base 16) | 3CF5 |
| Base 3 | 210101222 |
| As time | 15605 seconds = 4 h 20 min 5 s |
Is 15605 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 (15605 ÷ 5 = 3121) | 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 7) | 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 15605 a prime number?
No. 15605 = 5 × 3121, so it is divisible by 5.
What are the factors of 15605?
1, 5, 3121, 15605.
What is 15605 in binary?
11110011110101 (hexadecimal 3CF5, octal 36365).
What is the square root of 15605?
About 124.9200.
Is 15605 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 15605?
15605 is a semiprime: 5 × 3121, the product of two primes.