The number 1164
1164 is a composite number with 12 divisors. Its prime factorisation is × 3 × 97. Divisors (12): 1, 2, 3, 4, 6, 12, 97, 194, 291, 388, 582, 1164.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1164: a Harshad number: divisible by its digit sum 12.
- 2
1164 is composite. Its prime factorisation is
- 3
The divisors add up to 2744; without 1164 itself that is 1580, so 1164 is abundant (1580 is more than 1164). Euler's totient φ(1164) = 384 numbers up to 1164 share no factor with it.
- 4
The digits of 1164 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 119 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1164 = 2^{2} \times 3 \times 97 \]1164 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 2744 |
| Euler totient φ(n) | 384 |
| Square | 1354896 |
| Cube | 1577098944 |
| Square root | 34.117444 (= 2√291) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 119 |
| Scientific notation | 1.164 × |
1164 in other forms
| Form | Value |
|---|---|
| In words | one thousand one hundred and sixty-four |
| Roman numerals | MCLXIV |
| Binary (base 2) | 10010001100 |
| Octal (base 8) | 2214 |
| Hexadecimal (base 16) | 48C |
| Base 3 | 1121010 |
| As time | 1164 seconds = 19 min 24 s |
Is 1164 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1164 ÷ 2 = 582) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (1164 ÷ 3 = 388) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (1164 ÷ 4 = 291) | 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 | Yes (1164 ÷ 6 = 194) | 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 | No (remainder 4) | 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 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 | Yes (1164 ÷ 12 = 97) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1164 a prime number?
No. 1164 = × 3 × 97, so it is divisible by 2.
What are the factors of 1164?
1, 2, 3, 4, 6, 12, 97, 194, 291, 388, 582, 1164.
What is 1164 in binary?
10010001100 (hexadecimal 48C, octal 2214).
What is the square root of 1164?
About 34.1174, exactly 2√291.
What is 1164 in Roman numerals?
MCLXIV.
Is 1164 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 1164?
1164 is a Harshad number: divisible by its digit sum 12.