The number 53602
53602 is a composite number with 4 divisors. Its prime factorisation is 2 × 26801. Divisors (4): 1, 2, 26801, 53602.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53602: a semiprime: 2 × 26801, the product of two primes.
- 2
53602 is composite. Its prime factorisation is
- 3
The divisors add up to 80406; without 53602 itself that is 26804, so 53602 is deficient (26804 is less than 53602). Euler's totient φ(53602) = 26800 numbers up to 53602 share no factor with it.
- 4
The digits of 53602 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 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53602 = 2 \times 26801 \]
53602 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 80406 |
| Euler totient φ(n) | 26800 |
| Square | 2873174404 |
| Cube | 154007894403208 |
| Square root | 231.521057 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.3602 × |
53602 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand six hundred and two |
| Binary (base 2) | 1101000101100010 |
| Octal (base 8) | 150542 |
| Hexadecimal (base 16) | D162 |
| Base 3 | 2201112021 |
| As time | 53602 seconds = 14 h 53 min 22 s |
Is 53602 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53602 ÷ 2 = 26801) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 2) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53602 a prime number?
No. 53602 = 2 × 26801, so it is divisible by 2.
What are the factors of 53602?
1, 2, 26801, 53602.
What is 53602 in binary?
1101000101100010 (hexadecimal D162, octal 150542).
What is the square root of 53602?
About 231.5211.
Is 53602 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 53602?
53602 is a semiprime: 2 × 26801, the product of two primes.