The number 52602
52602 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 11 × 797. Divisors (16): 1, 2, 3, 6, 11, 22, 33, 66, 797, 1594, 2391, 4782, 8767, 17534, 26301, 52602.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
52602 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
52602 is composite. Its prime factorisation is
- 3
The divisors add up to 114912; without 52602 itself that is 62310, so 52602 is abundant (62310 is more than 52602). Euler's totient φ(52602) = 15920 numbers up to 52602 share no factor with it.
- 4
The digits of 52602 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52602 = 2 \times 3 \times 11 \times 797 \]
52602 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 114912 |
| Euler totient φ(n) | 15920 |
| Square | 2766970404 |
| Cube | 145548177191208 |
| Square root | 229.351259 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.2602 × |
52602 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand six hundred and two |
| Binary (base 2) | 1100110101111010 |
| Octal (base 8) | 146572 |
| Hexadecimal (base 16) | CD7A |
| Base 3 | 2200011020 |
| As time | 52602 seconds = 14 h 36 min 42 s |
Is 52602 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52602 ÷ 2 = 26301) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (52602 ÷ 3 = 17534) | 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 | Yes (52602 ÷ 6 = 8767) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 6) | 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 | Yes (52602 ÷ 11 = 4782) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52602 a prime number?
No. 52602 = 2 × 3 × 11 × 797, so it is divisible by 2.
What are the factors of 52602?
1, 2, 3, 6, 11, 22, 33, 66, 797, 1594, 2391, 4782, 8767, 17534, 26301, 52602.
What is 52602 in binary?
1100110101111010 (hexadecimal CD7A, octal 146572).
What is the square root of 52602?
About 229.3513.
Is 52602 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 52602?
It is a composite number with 16 divisors.