The number 11640
11640 is a composite number with 32 divisors. Its prime factorisation is × 3 × 5 × 97. Divisors (32): 1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 20, 24, 30, 40, 60, 97 … 11640.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11640: a Harshad number: divisible by its digit sum 12.
- 2
11640 is composite. Its prime factorisation is
- 3
The divisors add up to 35280; without 11640 itself that is 23640, so 11640 is abundant (23640 is more than 11640). Euler's totient φ(11640) = 3072 numbers up to 11640 share no factor with it.
- 4
The digits of 11640 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 143 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11640 = 2^{3} \times 3 \times 5 \times 97 \]11640 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 35280 |
| Euler totient φ(n) | 3072 |
| Square | 135489600 |
| Cube | 1577098944000 |
| Square root | 107.888832 (= 2√2910) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 143 |
| Scientific notation | 1.164 × |
11640 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand six hundred and forty |
| Binary (base 2) | 10110101111000 |
| Octal (base 8) | 26570 |
| Hexadecimal (base 16) | 2D78 |
| Base 3 | 120222010 |
| As time | 11640 seconds = 3 h 14 min 0 s |
Is 11640 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11640 ÷ 2 = 5820) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (11640 ÷ 3 = 3880) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (11640 ÷ 4 = 2910) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (11640 ÷ 5 = 2328) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (11640 ÷ 6 = 1940) | 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 | Yes (11640 ÷ 8 = 1455) | 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 | Yes (11640 ÷ 10 = 1164) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (11640 ÷ 12 = 970) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11640 a prime number?
No. 11640 = × 3 × 5 × 97, so it is divisible by 2.
What are the factors of 11640?
1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 20, 24, 30, 40, 60, 97, 120, 194, 291, 388, 485, 582, 776, 970, 1164, 1455, 1940, 2328, 2910, 3880, 5820, 11640.
What is 11640 in binary?
10110101111000 (hexadecimal 2D78, octal 26570).
What is the square root of 11640?
About 107.8888, exactly 2√2910.
Is 11640 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 11640?
11640 is a Harshad number: divisible by its digit sum 12.