The number 11488
11488 is a composite number with 12 divisors. Its prime factorisation is × 359. Divisors (12): 1, 2, 4, 8, 16, 32, 359, 718, 1436, 2872, 5744, 11488.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11488 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11488 is composite. Its prime factorisation is
- 3
The divisors add up to 22680; without 11488 itself that is 11192, so 11488 is deficient (11192 is less than 11488). Euler's totient φ(11488) = 5728 numbers up to 11488 share no factor with it.
- 4
The digits of 11488 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11488 = 2^{5} \times 359 \]11488 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 22680 |
| Euler totient φ(n) | 5728 |
| Square | 131974144 |
| Cube | 1516118966272 |
| Square root | 107.182088 (= 4√718) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 55 |
| Scientific notation | 1.1488 × |
11488 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand four hundred and eighty-eight |
| Binary (base 2) | 10110011100000 |
| Octal (base 8) | 26340 |
| Hexadecimal (base 16) | 2CE0 |
| Base 3 | 120202111 |
| As time | 11488 seconds = 3 h 11 min 28 s |
Is 11488 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11488 ÷ 2 = 5744) | 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 (11488 ÷ 4 = 2872) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 1) | 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 (11488 ÷ 8 = 1436) | 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 8) | 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 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11488 a prime number?
No. 11488 = × 359, so it is divisible by 2.
What are the factors of 11488?
1, 2, 4, 8, 16, 32, 359, 718, 1436, 2872, 5744, 11488.
What is 11488 in binary?
10110011100000 (hexadecimal 2CE0, octal 26340).
What is the square root of 11488?
About 107.1821, exactly 4√718.
Is 11488 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 11488?
It is a composite number with 12 divisors.