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