The number 50605
50605 is a palindrome: it reads 50605 backwards too. Its prime factorisation is 5 × 29 × 349. Divisors (8): 1, 5, 29, 145, 349, 1745, 10121, 50605.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50605: a palindrome: it reads 50605 backwards too; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
50605 is composite. Its prime factorisation is
- 3
The divisors add up to 63000; without 50605 itself that is 12395, so 50605 is deficient (12395 is less than 50605). Euler's totient φ(50605) = 38976 numbers up to 50605 share no factor with it.
- 4
The digits of 50605 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50605 = 5 \times 29 \times 349 \]
50605 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 63000 |
| Euler totient φ(n) | 38976 |
| Square | 2560866025 |
| Cube | 129592625195125 |
| Square root | 224.955551 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0605 × |
50605 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand six hundred and five |
| Binary (base 2) | 1100010110101101 |
| Octal (base 8) | 142655 |
| Hexadecimal (base 16) | C5AD |
| Base 3 | 2120102021 |
| As time | 50605 seconds = 14 h 3 min 25 s |
Is 50605 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 (50605 ÷ 5 = 10121) | 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 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 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 5) | 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 50605 a prime number?
No. 50605 = 5 × 29 × 349, so it is divisible by 5.
What are the factors of 50605?
1, 5, 29, 145, 349, 1745, 10121, 50605.
What is 50605 in binary?
1100010110101101 (hexadecimal C5AD, octal 142655).
What is the square root of 50605?
About 224.9556.
Is 50605 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 50605?
50605 is a palindrome: it reads 50605 backwards too; a happy number: repeatedly adding the squares of its digits reaches 1.