The number 1169
1169 is a composite number with 4 divisors. Its prime factorisation is 7 × 167. Divisors (4): 1, 7, 167, 1169.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1169: a semiprime: 7 × 167, the product of two primes.
- 2
1169 is composite. Its prime factorisation is
- 3
The divisors add up to 1344; without 1169 itself that is 175, so 1169 is deficient (175 is less than 1169). Euler's totient φ(1169) = 996 numbers up to 1169 share no factor with it.
- 4
The digits of 1169 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1169 = 7 \times 167 \]
1169 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1344 |
| Euler totient φ(n) | 996 |
| Square | 1366561 |
| Cube | 1597509809 |
| Square root | 34.190642 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 57 |
| Scientific notation | 1.169 × |
1169 in other forms
| Form | Value |
|---|---|
| In words | one thousand one hundred and sixty-nine |
| Roman numerals | MCLXIX |
| Binary (base 2) | 10010010001 |
| Octal (base 8) | 2221 |
| Hexadecimal (base 16) | 491 |
| Base 3 | 1121022 |
| As time | 1169 seconds = 19 min 29 s |
Is 1169 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 | No (remainder 1) | 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 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (1169 ÷ 7 = 167) | 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 1) | 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 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1169 a prime number?
No. 1169 = 7 × 167, so it is divisible by 7.
What are the factors of 1169?
1, 7, 167, 1169.
What is 1169 in binary?
10010010001 (hexadecimal 491, octal 2221).
What is the square root of 1169?
About 34.1906.
What is 1169 in Roman numerals?
MCLXIX.
Is 1169 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 1169?
1169 is a semiprime: 7 × 167, the product of two primes.