The number 52802
52802 is a composite number with 8 divisors. Its prime factorisation is 2 × 17 × 1553. Divisors (8): 1, 2, 17, 34, 1553, 3106, 26401, 52802.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52802: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 17.
- 2
52802 is composite. Its prime factorisation is
- 3
The divisors add up to 83916; without 52802 itself that is 31114, so 52802 is deficient (31114 is less than 52802). Euler's totient φ(52802) = 24832 numbers up to 52802 share no factor with it.
- 4
The digits of 52802 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52802 = 2 \times 17 \times 1553 \]
52802 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 83916 |
| Euler totient φ(n) | 24832 |
| Square | 2788051204 |
| Cube | 147214679673608 |
| Square root | 229.786858 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.2802 × |
52802 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand eight hundred and two |
| Binary (base 2) | 1100111001000010 |
| Octal (base 8) | 147102 |
| Hexadecimal (base 16) | CE42 |
| Base 3 | 2200102122 |
| As time | 52802 seconds = 14 h 40 min 2 s |
Is 52802 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52802 ÷ 2 = 26401) | 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 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 8) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52802 a prime number?
No. 52802 = 2 × 17 × 1553, so it is divisible by 2.
What are the factors of 52802?
1, 2, 17, 34, 1553, 3106, 26401, 52802.
What is 52802 in binary?
1100111001000010 (hexadecimal CE42, octal 147102).
What is the square root of 52802?
About 229.7869.
Is 52802 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 52802?
52802 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 17.