The number 5202
5202 is a composite number with 18 divisors. Its prime factorisation is 2 × × . Divisors (18): 1, 2, 3, 6, 9, 17, 18, 34, 51, 102, 153, 289, 306, 578, 867, 1734 … 5202.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5202: a Harshad number: divisible by its digit sum 9.
- 2
5202 is composite. Its prime factorisation is
- 3
The divisors add up to 11973; without 5202 itself that is 6771, so 5202 is abundant (6771 is more than 5202). Euler's totient φ(5202) = 1632 numbers up to 5202 share no factor with it.
- 4
The digits of 5202 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 178 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5202 = 2 \times 3^{2} \times 17^{2} \]5202 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 11973 |
| Euler totient φ(n) | 1632 |
| Square | 27060804 |
| Cube | 140770302408 |
| Square root | 72.124892 (= 51√2) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 178 |
| Scientific notation | 5.202 × |
5202 in other forms
| Form | Value |
|---|---|
| In words | five thousand two hundred and two |
| Binary (base 2) | 1010001010010 |
| Octal (base 8) | 12122 |
| Hexadecimal (base 16) | 1452 |
| Base 3 | 21010200 |
| As time | 5202 seconds = 1 h 26 min 42 s |
Is 5202 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5202 ÷ 2 = 2601) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (5202 ÷ 3 = 1734) | 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 (5202 ÷ 6 = 867) | 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 | Yes (5202 ÷ 9 = 578) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5202 a prime number?
No. 5202 = 2 × × , so it is divisible by 2.
What are the factors of 5202?
1, 2, 3, 6, 9, 17, 18, 34, 51, 102, 153, 289, 306, 578, 867, 1734, 2601, 5202.
What is 5202 in binary?
1010001010010 (hexadecimal 1452, octal 12122).
What is the square root of 5202?
About 72.1249, exactly 51√2.
Is 5202 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 5202?
5202 is a Harshad number: divisible by its digit sum 9.