The number 5605
5605 is a composite number with 8 divisors. Its prime factorisation is 5 × 19 × 59. Divisors (8): 1, 5, 19, 59, 95, 295, 1121, 5605.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5605: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
5605 is composite. Its prime factorisation is
- 3
The divisors add up to 7200; without 5605 itself that is 1595, so 5605 is deficient (1595 is less than 5605). Euler's totient φ(5605) = 4176 numbers up to 5605 share no factor with it.
- 4
The digits of 5605 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 98 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5605 = 5 \times 19 \times 59 \]
5605 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 7200 |
| Euler totient φ(n) | 4176 |
| Square | 31416025 |
| Cube | 176086820125 |
| Square root | 74.866548 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 98 |
| Scientific notation | 5.605 × |
5605 in other forms
| Form | Value |
|---|---|
| In words | five thousand six hundred and five |
| Binary (base 2) | 1010111100101 |
| Octal (base 8) | 12745 |
| Hexadecimal (base 16) | 15E5 |
| Base 3 | 21200121 |
| As time | 5605 seconds = 1 h 33 min 25 s |
Is 5605 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 1) | 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 (5605 ÷ 5 = 1121) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 7) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5605 a prime number?
No. 5605 = 5 × 19 × 59, so it is divisible by 5.
What are the factors of 5605?
1, 5, 19, 59, 95, 295, 1121, 5605.
What is 5605 in binary?
1010111100101 (hexadecimal 15E5, octal 12745).
What is the square root of 5605?
About 74.8665.
Is 5605 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 5605?
5605 is a happy number: repeatedly adding the squares of its digits reaches 1.