The number 1167
1167 is a composite number with 4 divisors. Its prime factorisation is 3 × 389. Divisors (4): 1, 3, 389, 1167.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1167: a semiprime: 3 × 389, the product of two primes.
- 2
1167 is composite. Its prime factorisation is
- 3
The divisors add up to 1560; without 1167 itself that is 393, so 1167 is deficient (393 is less than 1167). Euler's totient φ(1167) = 776 numbers up to 1167 share no factor with it.
- 4
The digits of 1167 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 31 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1167 = 3 \times 389 \]
1167 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1560 |
| Euler totient φ(n) | 776 |
| Square | 1361889 |
| Cube | 1589324463 |
| Square root | 34.161382 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 31 |
| Scientific notation | 1.167 × |
1167 in other forms
| Form | Value |
|---|---|
| In words | one thousand one hundred and sixty-seven |
| Roman numerals | MCLXVII |
| Binary (base 2) | 10010001111 |
| Octal (base 8) | 2217 |
| Hexadecimal (base 16) | 48F |
| Base 3 | 1121020 |
| As time | 1167 seconds = 19 min 27 s |
Is 1167 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 | Yes (1167 ÷ 3 = 389) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 | No (remainder 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1167 a prime number?
No. 1167 = 3 × 389, so it is divisible by 3.
What are the factors of 1167?
1, 3, 389, 1167.
What is 1167 in binary?
10010001111 (hexadecimal 48F, octal 2217).
What is the square root of 1167?
About 34.1614.
What is 1167 in Roman numerals?
MCLXVII.
Is 1167 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 1167?
1167 is a semiprime: 3 × 389, the product of two primes.