The number 2052
2052 is a composite number with 24 divisors. Its prime factorisation is × × 19. Divisors (24): 1, 2, 3, 4, 6, 9, 12, 18, 19, 27, 36, 38, 54, 57, 76, 108 … 2052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 2052: a Harshad number: divisible by its digit sum 9.
- 2
2052 is composite. Its prime factorisation is
- 3
The divisors add up to 5600; without 2052 itself that is 3548, so 2052 is abundant (3548 is more than 2052). Euler's totient φ(2052) = 648 numbers up to 2052 share no factor with it.
- 4
The digits of 2052 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 37 steps to reach 1.
LaTeX source of the formulas on this page
\[ 2052 = 2^{2} \times 3^{3} \times 19 \]2052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 5600 |
| Euler totient φ(n) | 648 |
| Square | 4210704 |
| Cube | 8640364608 |
| Square root | 45.299007 (= 6√57) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 37 |
| Scientific notation | 2.052 × |
2052 in other forms
| Form | Value |
|---|---|
| In words | two thousand and fifty-two |
| Roman numerals | MMLII |
| Binary (base 2) | 100000000100 |
| Octal (base 8) | 4004 |
| Hexadecimal (base 16) | 804 |
| Base 3 | 2211000 |
| As time | 2052 seconds = 34 min 12 s |
Is 2052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (2052 ÷ 2 = 1026) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (2052 ÷ 3 = 684) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (2052 ÷ 4 = 513) | 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 (2052 ÷ 6 = 342) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (2052 ÷ 9 = 228) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (2052 ÷ 12 = 171) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 2052 a prime number?
No. 2052 = × × 19, so it is divisible by 2.
What are the factors of 2052?
1, 2, 3, 4, 6, 9, 12, 18, 19, 27, 36, 38, 54, 57, 76, 108, 114, 171, 228, 342, 513, 684, 1026, 2052.
What is 2052 in binary?
100000000100 (hexadecimal 804, octal 4004).
What is the square root of 2052?
About 45.2990, exactly 6√57.
What is 2052 in Roman numerals?
MMLII.
Is 2052 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 2052?
2052 is a Harshad number: divisible by its digit sum 9.