The number 9169
9169 is a composite number with 4 divisors. Its prime factorisation is 53 × 173. Divisors (4): 1, 53, 173, 9169.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9169: a semiprime: 53 × 173, the product of two primes.
- 2
9169 is composite. Its prime factorisation is
- 3
The divisors add up to 9396; without 9169 itself that is 227, so 9169 is deficient (227 is less than 9169). Euler's totient φ(9169) = 8944 numbers up to 9169 share no factor with it.
- 4
The digits of 9169 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9169 = 53 \times 173 \]
9169 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 9396 |
| Euler totient φ(n) | 8944 |
| Square | 84070561 |
| Cube | 770842973809 |
| Square root | 95.754895 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 153 |
| Scientific notation | 9.169 × |
9169 in other forms
| Form | Value |
|---|---|
| In words | nine thousand one hundred and sixty-nine |
| Binary (base 2) | 10001111010001 |
| Octal (base 8) | 21721 |
| Hexadecimal (base 16) | 23D1 |
| Base 3 | 110120121 |
| As time | 9169 seconds = 2 h 32 min 49 s |
Is 9169 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 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 1) | 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 | No (remainder 1) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9169 a prime number?
No. 9169 = 53 × 173, so it is divisible by 53.
What are the factors of 9169?
1, 53, 173, 9169.
What is 9169 in binary?
10001111010001 (hexadecimal 23D1, octal 21721).
What is the square root of 9169?
About 95.7549.
Is 9169 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 9169?
9169 is a semiprime: 53 × 173, the product of two primes.