The number 11169
11169 is a composite number with 12 divisors. Its prime factorisation is × 17 × 73. Divisors (12): 1, 3, 9, 17, 51, 73, 153, 219, 657, 1241, 3723, 11169.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11169 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11169 is composite. Its prime factorisation is
- 3
The divisors add up to 17316; without 11169 itself that is 6147, so 11169 is deficient (6147 is less than 11169). Euler's totient φ(11169) = 6912 numbers up to 11169 share no factor with it.
- 4
The digits of 11169 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 161 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11169 = 3^{2} \times 17 \times 73 \]11169 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 17316 |
| Euler totient φ(n) | 6912 |
| Square | 124746561 |
| Cube | 1393294339809 |
| Square root | 105.683490 (= 3√1241) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 161 |
| Scientific notation | 1.1169 × |
11169 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand one hundred and sixty-nine |
| Binary (base 2) | 10101110100001 |
| Octal (base 8) | 25641 |
| Hexadecimal (base 16) | 2BA1 |
| Base 3 | 120022200 |
| As time | 11169 seconds = 3 h 6 min 9 s |
Is 11169 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 (11169 ÷ 3 = 3723) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 | Yes (11169 ÷ 9 = 1241) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11169 a prime number?
No. 11169 = × 17 × 73, so it is divisible by 3.
What are the factors of 11169?
1, 3, 9, 17, 51, 73, 153, 219, 657, 1241, 3723, 11169.
What is 11169 in binary?
10101110100001 (hexadecimal 2BA1, octal 25641).
What is the square root of 11169?
About 105.6835, exactly 3√1241.
Is 11169 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 11169?
It is a composite number with 12 divisors.