The number 11632
11632 is a composite number with 10 divisors. Its prime factorisation is × 727. Divisors (10): 1, 2, 4, 8, 16, 727, 1454, 2908, 5816, 11632.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11632 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11632 is composite. Its prime factorisation is
- 3
The divisors add up to 22568; without 11632 itself that is 10936, so 11632 is deficient (10936 is less than 11632). Euler's totient φ(11632) = 5808 numbers up to 11632 share no factor with it.
- 4
The digits of 11632 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 50 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11632 = 2^{4} \times 727 \]11632 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 22568 |
| Euler totient φ(n) | 5808 |
| Square | 135303424 |
| Cube | 1573849427968 |
| Square root | 107.851750 (= 4√727) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 50 |
| Scientific notation | 1.1632 × |
11632 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand six hundred and thirty-two |
| Binary (base 2) | 10110101110000 |
| Octal (base 8) | 26560 |
| Hexadecimal (base 16) | 2D70 |
| Base 3 | 120221211 |
| As time | 11632 seconds = 3 h 13 min 52 s |
Is 11632 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11632 ÷ 2 = 5816) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (11632 ÷ 4 = 2908) | 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 | No (remainder 4) | 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 (11632 ÷ 8 = 1454) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11632 a prime number?
No. 11632 = × 727, so it is divisible by 2.
What are the factors of 11632?
1, 2, 4, 8, 16, 727, 1454, 2908, 5816, 11632.
What is 11632 in binary?
10110101110000 (hexadecimal 2D70, octal 26560).
What is the square root of 11632?
About 107.8518, exactly 4√727.
Is 11632 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 11632?
It is a composite number with 10 divisors.