The number 1160
1160 is a composite number with 16 divisors. Its prime factorisation is × 5 × 29. Divisors (16): 1, 2, 4, 5, 8, 10, 20, 29, 40, 58, 116, 145, 232, 290, 580, 1160.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1160: a Harshad number: divisible by its digit sum 8.
- 2
1160 is composite. Its prime factorisation is
- 3
The divisors add up to 2700; without 1160 itself that is 1540, so 1160 is abundant (1540 is more than 1160). Euler's totient φ(1160) = 448 numbers up to 1160 share no factor with it.
- 4
The digits of 1160 add up to 8, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 119 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1160 = 2^{3} \times 5 \times 29 \]1160 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 2700 |
| Euler totient φ(n) | 448 |
| Square | 1345600 |
| Cube | 1560896000 |
| Square root | 34.058773 (= 2√290) |
| Digit sum / digital root | 8 / 8 |
| Collatz steps to 1 | 119 |
| Scientific notation | 1.16 × |
1160 in other forms
| Form | Value |
|---|---|
| In words | one thousand one hundred and sixty |
| Roman numerals | MCLX |
| Binary (base 2) | 10010001000 |
| Octal (base 8) | 2210 |
| Hexadecimal (base 16) | 488 |
| Base 3 | 1120222 |
| As time | 1160 seconds = 19 min 20 s |
Is 1160 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1160 ÷ 2 = 580) | 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 (1160 ÷ 4 = 290) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (1160 ÷ 5 = 232) | 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 5) | 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 (1160 ÷ 8 = 145) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (1160 ÷ 10 = 116) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1160 a prime number?
No. 1160 = × 5 × 29, so it is divisible by 2.
What are the factors of 1160?
1, 2, 4, 5, 8, 10, 20, 29, 40, 58, 116, 145, 232, 290, 580, 1160.
What is 1160 in binary?
10010001000 (hexadecimal 488, octal 2210).
What is the square root of 1160?
About 34.0588, exactly 2√290.
What is 1160 in Roman numerals?
MCLX.
Is 1160 divisible by 3?
No. Its digits add up to 8, which is not a multiple of 3.
What is special about the number 1160?
1160 is a Harshad number: divisible by its digit sum 8.