The number 1170
1170 is a composite number with 24 divisors. Its prime factorisation is 2 × × 5 × 13. Divisors (24): 1, 2, 3, 5, 6, 9, 10, 13, 15, 18, 26, 30, 39, 45, 65, 78 … 1170.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1170: a Harshad number: divisible by its digit sum 9.
- 2
1170 is composite. Its prime factorisation is
- 3
The divisors add up to 3276; without 1170 itself that is 2106, so 1170 is abundant (2106 is more than 1170). Euler's totient φ(1170) = 288 numbers up to 1170 share no factor with it.
- 4
The digits of 1170 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1170 = 2 \times 3^{2} \times 5 \times 13 \]1170 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 3276 |
| Euler totient φ(n) | 288 |
| Square | 1368900 |
| Cube | 1601613000 |
| Square root | 34.205263 (= 3√130) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 57 |
| Scientific notation | 1.17 × |
1170 in other forms
| Form | Value |
|---|---|
| In words | one thousand one hundred and seventy |
| Roman numerals | MCLXX |
| Binary (base 2) | 10010010010 |
| Octal (base 8) | 2222 |
| Hexadecimal (base 16) | 492 |
| Base 3 | 1121100 |
| As time | 1170 seconds = 19 min 30 s |
Is 1170 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1170 ÷ 2 = 585) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (1170 ÷ 3 = 390) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (1170 ÷ 5 = 234) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (1170 ÷ 6 = 195) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (1170 ÷ 9 = 130) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (1170 ÷ 10 = 117) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1170 a prime number?
No. 1170 = 2 × × 5 × 13, so it is divisible by 2.
What are the factors of 1170?
1, 2, 3, 5, 6, 9, 10, 13, 15, 18, 26, 30, 39, 45, 65, 78, 90, 117, 130, 195, 234, 390, 585, 1170.
What is 1170 in binary?
10010010010 (hexadecimal 492, octal 2222).
What is the square root of 1170?
About 34.2053, exactly 3√130.
What is 1170 in Roman numerals?
MCLXX.
Is 1170 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 1170?
1170 is a Harshad number: divisible by its digit sum 9.