The number 1168
1168 is a composite number with 10 divisors. Its prime factorisation is × 73. Divisors (10): 1, 2, 4, 8, 16, 73, 146, 292, 584, 1168.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1168: a Harshad number: divisible by its digit sum 16.
- 2
1168 is composite. Its prime factorisation is
- 3
The divisors add up to 2294; without 1168 itself that is 1126, so 1168 is deficient (1126 is less than 1168). Euler's totient φ(1168) = 576 numbers up to 1168 share no factor with it.
- 4
The digits of 1168 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 119 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1168 = 2^{4} \times 73 \]1168 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 2294 |
| Euler totient φ(n) | 576 |
| Square | 1364224 |
| Cube | 1593413632 |
| Square root | 34.176015 (= 4√73) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 119 |
| Scientific notation | 1.168 × |
1168 in other forms
| Form | Value |
|---|---|
| In words | one thousand one hundred and sixty-eight |
| Roman numerals | MCLXVIII |
| Binary (base 2) | 10010010000 |
| Octal (base 8) | 2220 |
| Hexadecimal (base 16) | 490 |
| Base 3 | 1121021 |
| As time | 1168 seconds = 19 min 28 s |
Is 1168 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1168 ÷ 2 = 584) | 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 (1168 ÷ 4 = 292) | 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 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 (1168 ÷ 8 = 146) | 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 2) | 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 1168 a prime number?
No. 1168 = × 73, so it is divisible by 2.
What are the factors of 1168?
1, 2, 4, 8, 16, 73, 146, 292, 584, 1168.
What is 1168 in binary?
10010010000 (hexadecimal 490, octal 2220).
What is the square root of 1168?
About 34.1760, exactly 4√73.
What is 1168 in Roman numerals?
MCLXVIII.
Is 1168 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 1168?
1168 is a Harshad number: divisible by its digit sum 16.