The number 11608
11608 is a composite number with 8 divisors. Its prime factorisation is × 1451. Divisors (8): 1, 2, 4, 8, 1451, 2902, 5804, 11608.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11608 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11608 is composite. Its prime factorisation is
- 3
The divisors add up to 21780; without 11608 itself that is 10172, so 11608 is deficient (10172 is less than 11608). Euler's totient φ(11608) = 5800 numbers up to 11608 share no factor with it.
- 4
The digits of 11608 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 143 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11608 = 2^{3} \times 1451 \]11608 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 21780 |
| Euler totient φ(n) | 5800 |
| Square | 134745664 |
| Cube | 1564127667712 |
| Square root | 107.740429 (= 2√2902) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 143 |
| Scientific notation | 1.1608 × |
11608 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand six hundred and eight |
| Binary (base 2) | 10110101011000 |
| Octal (base 8) | 26530 |
| Hexadecimal (base 16) | 2D58 |
| Base 3 | 120220221 |
| As time | 11608 seconds = 3 h 13 min 28 s |
Is 11608 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11608 ÷ 2 = 5804) | 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 (11608 ÷ 4 = 2902) | 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 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 (11608 ÷ 8 = 1451) | 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 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 11608 a prime number?
No. 11608 = × 1451, so it is divisible by 2.
What are the factors of 11608?
1, 2, 4, 8, 1451, 2902, 5804, 11608.
What is 11608 in binary?
10110101011000 (hexadecimal 2D58, octal 26530).
What is the square root of 11608?
About 107.7404, exactly 2√2902.
Is 11608 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 11608?
It is a composite number with 8 divisors.