The number 11532
11532 is a composite number with 18 divisors. Its prime factorisation is × 3 × . Divisors (18): 1, 2, 3, 4, 6, 12, 31, 62, 93, 124, 186, 372, 961, 1922, 2883, 3844 … 11532.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11532: a Harshad number: divisible by its digit sum 12.
- 2
11532 is composite. Its prime factorisation is
- 3
The divisors add up to 27804; without 11532 itself that is 16272, so 11532 is abundant (16272 is more than 11532). Euler's totient φ(11532) = 3720 numbers up to 11532 share no factor with it.
- 4
The digits of 11532 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 143 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11532 = 2^{2} \times 3 \times 31^{2} \]11532 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 27804 |
| Euler totient φ(n) | 3720 |
| Square | 132987024 |
| Cube | 1533606360768 |
| Square root | 107.387150 (= 62√3) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 143 |
| Scientific notation | 1.1532 × |
11532 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand five hundred and thirty-two |
| Binary (base 2) | 10110100001100 |
| Octal (base 8) | 26414 |
| Hexadecimal (base 16) | 2D0C |
| Base 3 | 120211010 |
| As time | 11532 seconds = 3 h 12 min 12 s |
Is 11532 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11532 ÷ 2 = 5766) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (11532 ÷ 3 = 3844) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (11532 ÷ 4 = 2883) | 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 (11532 ÷ 6 = 1922) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (11532 ÷ 12 = 961) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11532 a prime number?
No. 11532 = × 3 × , so it is divisible by 2.
What are the factors of 11532?
1, 2, 3, 4, 6, 12, 31, 62, 93, 124, 186, 372, 961, 1922, 2883, 3844, 5766, 11532.
What is 11532 in binary?
10110100001100 (hexadecimal 2D0C, octal 26414).
What is the square root of 11532?
About 107.3872, exactly 62√3.
Is 11532 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 11532?
11532 is a Harshad number: divisible by its digit sum 12.