The number 11352
11352 is a composite number with 32 divisors. Its prime factorisation is × 3 × 11 × 43. Divisors (32): 1, 2, 3, 4, 6, 8, 11, 12, 22, 24, 33, 43, 44, 66, 86, 88 … 11352.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11352: a Harshad number: divisible by its digit sum 12.
- 2
11352 is composite. Its prime factorisation is
- 3
The divisors add up to 31680; without 11352 itself that is 20328, so 11352 is abundant (20328 is more than 11352). Euler's totient φ(11352) = 3360 numbers up to 11352 share no factor with it.
- 4
The digits of 11352 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 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11352 = 2^{3} \times 3 \times 11 \times 43 \]11352 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 31680 |
| Euler totient φ(n) | 3360 |
| Square | 128867904 |
| Cube | 1462908446208 |
| Square root | 106.545765 (= 2√2838) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 130 |
| Scientific notation | 1.1352 × |
11352 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand three hundred and fifty-two |
| Binary (base 2) | 10110001011000 |
| Octal (base 8) | 26130 |
| Hexadecimal (base 16) | 2C58 |
| Base 3 | 120120110 |
| As time | 11352 seconds = 3 h 9 min 12 s |
Is 11352 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11352 ÷ 2 = 5676) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (11352 ÷ 3 = 3784) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (11352 ÷ 4 = 2838) | 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 (11352 ÷ 6 = 1892) | 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 (11352 ÷ 8 = 1419) | 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 | Yes (11352 ÷ 11 = 1032) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (11352 ÷ 12 = 946) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11352 a prime number?
No. 11352 = × 3 × 11 × 43, so it is divisible by 2.
What are the factors of 11352?
1, 2, 3, 4, 6, 8, 11, 12, 22, 24, 33, 43, 44, 66, 86, 88, 129, 132, 172, 258, 264, 344, 473, 516, 946, 1032, 1419, 1892, 2838, 3784, 5676, 11352.
What is 11352 in binary?
10110001011000 (hexadecimal 2C58, octal 26130).
What is the square root of 11352?
About 106.5458, exactly 2√2838.
Is 11352 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 11352?
11352 is a Harshad number: divisible by its digit sum 12.