The number 11167
11167 is a composite number with 4 divisors. Its prime factorisation is 13 × 859. Divisors (4): 1, 13, 859, 11167.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11167: a semiprime: 13 × 859, the product of two primes.
- 2
11167 is composite. Its prime factorisation is
- 3
The divisors add up to 12040; without 11167 itself that is 873, so 11167 is deficient (873 is less than 11167). Euler's totient φ(11167) = 10296 numbers up to 11167 share no factor with it.
- 4
The digits of 11167 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 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11167 = 13 \times 859 \]
11167 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 12040 |
| Euler totient φ(n) | 10296 |
| Square | 124701889 |
| Cube | 1392545994463 |
| Square root | 105.674027 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 68 |
| Scientific notation | 1.1167 × |
11167 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand one hundred and sixty-seven |
| Binary (base 2) | 10101110011111 |
| Octal (base 8) | 25637 |
| Hexadecimal (base 16) | 2B9F |
| Base 3 | 120022121 |
| As time | 11167 seconds = 3 h 6 min 7 s |
Is 11167 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 7) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11167 a prime number?
No. 11167 = 13 × 859, so it is divisible by 13.
What are the factors of 11167?
1, 13, 859, 11167.
What is 11167 in binary?
10101110011111 (hexadecimal 2B9F, octal 25637).
What is the square root of 11167?
About 105.6740.
Is 11167 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 11167?
11167 is a semiprime: 13 × 859, the product of two primes.