The number 3252
3252 is a composite number with 12 divisors. Its prime factorisation is × 3 × 271. Divisors (12): 1, 2, 3, 4, 6, 12, 271, 542, 813, 1084, 1626, 3252.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 3252: a Harshad number: divisible by its digit sum 12.
- 2
3252 is composite. Its prime factorisation is
- 3
The divisors add up to 7616; without 3252 itself that is 4364, so 3252 is abundant (4364 is more than 3252). Euler's totient φ(3252) = 1080 numbers up to 3252 share no factor with it.
- 4
The digits of 3252 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 43 steps to reach 1.
LaTeX source of the formulas on this page
\[ 3252 = 2^{2} \times 3 \times 271 \]3252 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 7616 |
| Euler totient φ(n) | 1080 |
| Square | 10575504 |
| Cube | 34391539008 |
| Square root | 57.026310 (= 2√813) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 43 |
| Scientific notation | 3.252 × |
3252 in other forms
| Form | Value |
|---|---|
| In words | three thousand two hundred and fifty-two |
| Roman numerals | MMMCCLII |
| Binary (base 2) | 110010110100 |
| Octal (base 8) | 6264 |
| Hexadecimal (base 16) | CB4 |
| Base 3 | 11110110 |
| As time | 3252 seconds = 54 min 12 s |
Is 3252 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (3252 ÷ 2 = 1626) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (3252 ÷ 3 = 1084) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (3252 ÷ 4 = 813) | 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 (3252 ÷ 6 = 542) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (3252 ÷ 12 = 271) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 3252 a prime number?
No. 3252 = × 3 × 271, so it is divisible by 2.
What are the factors of 3252?
1, 2, 3, 4, 6, 12, 271, 542, 813, 1084, 1626, 3252.
What is 3252 in binary?
110010110100 (hexadecimal CB4, octal 6264).
What is the square root of 3252?
About 57.0263, exactly 2√813.
What is 3252 in Roman numerals?
MMMCCLII.
Is 3252 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 3252?
3252 is a Harshad number: divisible by its digit sum 12.