The number 5052
5052 is a composite number with 12 divisors. Its prime factorisation is × 3 × 421. Divisors (12): 1, 2, 3, 4, 6, 12, 421, 842, 1263, 1684, 2526, 5052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5052: a Harshad number: divisible by its digit sum 12.
- 2
5052 is composite. Its prime factorisation is
- 3
The divisors add up to 11816; without 5052 itself that is 6764, so 5052 is abundant (6764 is more than 5052). Euler's totient φ(5052) = 1680 numbers up to 5052 share no factor with it.
- 4
The digits of 5052 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 178 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5052 = 2^{2} \times 3 \times 421 \]5052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 11816 |
| Euler totient φ(n) | 1680 |
| Square | 25522704 |
| Cube | 128940700608 |
| Square root | 71.077423 (= 2√1263) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 178 |
| Scientific notation | 5.052 × |
5052 in other forms
| Form | Value |
|---|---|
| In words | five thousand and fifty-two |
| Binary (base 2) | 1001110111100 |
| Octal (base 8) | 11674 |
| Hexadecimal (base 16) | 13BC |
| Base 3 | 20221010 |
| As time | 5052 seconds = 1 h 24 min 12 s |
Is 5052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5052 ÷ 2 = 2526) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (5052 ÷ 3 = 1684) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (5052 ÷ 4 = 1263) | 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 (5052 ÷ 6 = 842) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (5052 ÷ 12 = 421) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5052 a prime number?
No. 5052 = × 3 × 421, so it is divisible by 2.
What are the factors of 5052?
1, 2, 3, 4, 6, 12, 421, 842, 1263, 1684, 2526, 5052.
What is 5052 in binary?
1001110111100 (hexadecimal 13BC, octal 11674).
What is the square root of 5052?
About 71.0774, exactly 2√1263.
Is 5052 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 5052?
5052 is a Harshad number: divisible by its digit sum 12.