The number 2532
2532 is a composite number with 12 divisors. Its prime factorisation is × 3 × 211. Divisors (12): 1, 2, 3, 4, 6, 12, 211, 422, 633, 844, 1266, 2532.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 2532: a Harshad number: divisible by its digit sum 12.
- 2
2532 is composite. Its prime factorisation is
- 3
The divisors add up to 5936; without 2532 itself that is 3404, so 2532 is abundant (3404 is more than 2532). Euler's totient φ(2532) = 840 numbers up to 2532 share no factor with it.
- 4
The digits of 2532 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 32 steps to reach 1.
LaTeX source of the formulas on this page
\[ 2532 = 2^{2} \times 3 \times 211 \]2532 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 5936 |
| Euler totient φ(n) | 840 |
| Square | 6411024 |
| Cube | 16232712768 |
| Square root | 50.318983 (= 2√633) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 32 |
| Scientific notation | 2.532 × |
2532 in other forms
| Form | Value |
|---|---|
| In words | two thousand five hundred and thirty-two |
| Roman numerals | MMDXXXII |
| Binary (base 2) | 100111100100 |
| Octal (base 8) | 4744 |
| Hexadecimal (base 16) | 9E4 |
| Base 3 | 10110210 |
| As time | 2532 seconds = 42 min 12 s |
Is 2532 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (2532 ÷ 2 = 1266) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (2532 ÷ 3 = 844) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (2532 ÷ 4 = 633) | 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 (2532 ÷ 6 = 422) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (2532 ÷ 12 = 211) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 2532 a prime number?
No. 2532 = × 3 × 211, so it is divisible by 2.
What are the factors of 2532?
1, 2, 3, 4, 6, 12, 211, 422, 633, 844, 1266, 2532.
What is 2532 in binary?
100111100100 (hexadecimal 9E4, octal 4744).
What is the square root of 2532?
About 50.3190, exactly 2√633.
What is 2532 in Roman numerals?
MMDXXXII.
Is 2532 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 2532?
2532 is a Harshad number: divisible by its digit sum 12.