The number 11496
11496 is a composite number with 16 divisors. Its prime factorisation is × 3 × 479. Divisors (16): 1, 2, 3, 4, 6, 8, 12, 24, 479, 958, 1437, 1916, 2874, 3832, 5748, 11496.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11496 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11496 is composite. Its prime factorisation is
- 3
The divisors add up to 28800; without 11496 itself that is 17304, so 11496 is abundant (17304 is more than 11496). Euler's totient φ(11496) = 3824 numbers up to 11496 share no factor with it.
- 4
The digits of 11496 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11496 = 2^{3} \times 3 \times 479 \]11496 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 28800 |
| Euler totient φ(n) | 3824 |
| Square | 132158016 |
| Cube | 1519288551936 |
| Square root | 107.219401 (= 2√2874) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 55 |
| Scientific notation | 1.1496 × |
11496 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand four hundred and ninety-six |
| Binary (base 2) | 10110011101000 |
| Octal (base 8) | 26350 |
| Hexadecimal (base 16) | 2CE8 |
| Base 3 | 120202210 |
| As time | 11496 seconds = 3 h 11 min 36 s |
Is 11496 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11496 ÷ 2 = 5748) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (11496 ÷ 3 = 3832) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (11496 ÷ 4 = 2874) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (11496 ÷ 6 = 1916) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 (11496 ÷ 8 = 1437) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (11496 ÷ 12 = 958) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11496 a prime number?
No. 11496 = × 3 × 479, so it is divisible by 2.
What are the factors of 11496?
1, 2, 3, 4, 6, 8, 12, 24, 479, 958, 1437, 1916, 2874, 3832, 5748, 11496.
What is 11496 in binary?
10110011101000 (hexadecimal 2CE8, octal 26350).
What is the square root of 11496?
About 107.2194, exactly 2√2874.
Is 11496 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 11496?
It is a composite number with 16 divisors.