The number 605
605 is a composite number with 6 divisors. Its prime factorisation is 5 × . Divisors (6): 1, 5, 11, 55, 121, 605.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 605: a Harshad number: divisible by its digit sum 11.
- 2
605 is composite. Its prime factorisation is
- 3
The divisors add up to 798; without 605 itself that is 193, so 605 is deficient (193 is less than 605). Euler's totient φ(605) = 440 numbers up to 605 share no factor with it.
- 4
The digits of 605 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 17 steps to reach 1.
LaTeX source of the formulas on this page
\[ 605 = 5 \times 11^{2} \]605 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 798 |
| Euler totient φ(n) | 440 |
| Square | 366025 |
| Cube | 221445125 |
| Square root | 24.596748 (= 11√5) |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 17 |
| Scientific notation | 6.05 × |
605 in other forms
| Form | Value |
|---|---|
| In words | six hundred and five |
| Roman numerals | DCV |
| Binary (base 2) | 1001011101 |
| Octal (base 8) | 1135 |
| Hexadecimal (base 16) | 25D |
| Base 3 | 211102 |
| As time | 605 seconds = 10 min 5 s |
Is 605 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 (605 ÷ 5 = 121) | 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 3) | 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 | Yes (605 ÷ 11 = 55) | 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 605 a prime number?
No. 605 = 5 × , so it is divisible by 5.
What are the factors of 605?
1, 5, 11, 55, 121, 605.
What is 605 in binary?
1001011101 (hexadecimal 25D, octal 1135).
What is the square root of 605?
About 24.5967, exactly 11√5.
What is 605 in Roman numerals?
DCV.
Is 605 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 605?
605 is a Harshad number: divisible by its digit sum 11.