The number 53605
53605 is a composite number with 8 divisors. Its prime factorisation is 5 × 71 × 151. Divisors (8): 1, 5, 71, 151, 355, 755, 10721, 53605.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53605 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53605 is composite. Its prime factorisation is
- 3
The divisors add up to 65664; without 53605 itself that is 12059, so 53605 is deficient (12059 is less than 53605). Euler's totient φ(53605) = 42000 numbers up to 53605 share no factor with it.
- 4
The digits of 53605 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53605 = 5 \times 71 \times 151 \]
53605 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 65664 |
| Euler totient φ(n) | 42000 |
| Square | 2873496025 |
| Cube | 154033754420125 |
| Square root | 231.527536 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.3605 × |
53605 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand six hundred and five |
| Binary (base 2) | 1101000101100101 |
| Octal (base 8) | 150545 |
| Hexadecimal (base 16) | D165 |
| Base 3 | 2201112101 |
| As time | 53605 seconds = 14 h 53 min 25 s |
Is 53605 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 (53605 ÷ 5 = 10721) | 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 6) | 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 1) | 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 2) | 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 53605 a prime number?
No. 53605 = 5 × 71 × 151, so it is divisible by 5.
What are the factors of 53605?
1, 5, 71, 151, 355, 755, 10721, 53605.
What is 53605 in binary?
1101000101100101 (hexadecimal D165, octal 150545).
What is the square root of 53605?
About 231.5275.
Is 53605 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 53605?
It is a composite number with 8 divisors.