The number 11500
11500 is a composite number with 24 divisors. Its prime factorisation is × × 23. Divisors (24): 1, 2, 4, 5, 10, 20, 23, 25, 46, 50, 92, 100, 115, 125, 230, 250 … 11500.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11500 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11500 is composite. Its prime factorisation is
- 3
The divisors add up to 26208; without 11500 itself that is 14708, so 11500 is abundant (14708 is more than 11500). Euler's totient φ(11500) = 4400 numbers up to 11500 share no factor with it.
- 4
The digits of 11500 add up to 7, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11500 = 2^{2} \times 5^{3} \times 23 \]11500 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 26208 |
| Euler totient φ(n) | 4400 |
| Square | 132250000 |
| Cube | 1520875000000 |
| Square root | 107.238053 (= 10√115) |
| Digit sum / digital root | 7 / 7 |
| Collatz steps to 1 | 55 |
| Scientific notation | 1.15 × |
11500 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand five hundred |
| Binary (base 2) | 10110011101100 |
| Octal (base 8) | 26354 |
| Hexadecimal (base 16) | 2CEC |
| Base 3 | 120202221 |
| As time | 11500 seconds = 3 h 11 min 40 s |
Is 11500 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11500 ÷ 2 = 5750) | 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 (11500 ÷ 4 = 2875) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (11500 ÷ 5 = 2300) | 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 6) | 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 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (11500 ÷ 10 = 1150) | 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 11500 a prime number?
No. 11500 = × × 23, so it is divisible by 2.
What are the factors of 11500?
1, 2, 4, 5, 10, 20, 23, 25, 46, 50, 92, 100, 115, 125, 230, 250, 460, 500, 575, 1150, 2300, 2875, 5750, 11500.
What is 11500 in binary?
10110011101100 (hexadecimal 2CEC, octal 26354).
What is the square root of 11500?
About 107.2381, exactly 10√115.
Is 11500 divisible by 3?
No. Its digits add up to 7, which is not a multiple of 3.
What is special about the number 11500?
It is a composite number with 24 divisors.