The number 2952
2952 is a composite number with 24 divisors. Its prime factorisation is × × 41. Divisors (24): 1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 41, 72, 82, 123, 164 … 2952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 2952: a Harshad number: divisible by its digit sum 18.
- 2
2952 is composite. Its prime factorisation is
- 3
The divisors add up to 8190; without 2952 itself that is 5238, so 2952 is abundant (5238 is more than 2952). Euler's totient φ(2952) = 960 numbers up to 2952 share no factor with it.
- 4
The digits of 2952 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 22 steps to reach 1.
LaTeX source of the formulas on this page
\[ 2952 = 2^{3} \times 3^{2} \times 41 \]2952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 8190 |
| Euler totient φ(n) | 960 |
| Square | 8714304 |
| Cube | 25724625408 |
| Square root | 54.332311 (= 6√82) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 22 |
| Scientific notation | 2.952 × |
2952 in other forms
| Form | Value |
|---|---|
| In words | two thousand nine hundred and fifty-two |
| Roman numerals | MMCMLII |
| Binary (base 2) | 101110001000 |
| Octal (base 8) | 5610 |
| Hexadecimal (base 16) | B88 |
| Base 3 | 11001100 |
| As time | 2952 seconds = 49 min 12 s |
Is 2952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (2952 ÷ 2 = 1476) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (2952 ÷ 3 = 984) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (2952 ÷ 4 = 738) | 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 (2952 ÷ 6 = 492) | 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 | Yes (2952 ÷ 8 = 369) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (2952 ÷ 9 = 328) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (2952 ÷ 12 = 246) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 2952 a prime number?
No. 2952 = × × 41, so it is divisible by 2.
What are the factors of 2952?
1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 41, 72, 82, 123, 164, 246, 328, 369, 492, 738, 984, 1476, 2952.
What is 2952 in binary?
101110001000 (hexadecimal B88, octal 5610).
What is the square root of 2952?
About 54.3323, exactly 6√82.
What is 2952 in Roman numerals?
MMCMLII.
Is 2952 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 2952?
2952 is a Harshad number: divisible by its digit sum 18.