The number 10161
10161 is a composite number with 6 divisors. Its prime factorisation is × 1129. Divisors (6): 1, 3, 9, 1129, 3387, 10161.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10161: a Harshad number: divisible by its digit sum 9.
- 2
10161 is composite. Its prime factorisation is
- 3
The divisors add up to 14690; without 10161 itself that is 4529, so 10161 is deficient (4529 is less than 10161). Euler's totient φ(10161) = 6768 numbers up to 10161 share no factor with it.
- 4
The digits of 10161 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 42 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10161 = 3^{2} \times 1129 \]10161 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 14690 |
| Euler totient φ(n) | 6768 |
| Square | 103245921 |
| Cube | 1049081803281 |
| Square root | 100.801786 (= 3√1129) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 42 |
| Scientific notation | 1.0161 × |
10161 in other forms
| Form | Value |
|---|---|
| In words | ten thousand one hundred and sixty-one |
| Binary (base 2) | 10011110110001 |
| Octal (base 8) | 23661 |
| Hexadecimal (base 16) | 27B1 |
| Base 3 | 111221100 |
| As time | 10161 seconds = 2 h 49 min 21 s |
Is 10161 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 (10161 ÷ 3 = 3387) | 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 1) | 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 (10161 ÷ 9 = 1129) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 10161 a prime number?
No. 10161 = × 1129, so it is divisible by 3.
What are the factors of 10161?
1, 3, 9, 1129, 3387, 10161.
What is 10161 in binary?
10011110110001 (hexadecimal 27B1, octal 23661).
What is the square root of 10161?
About 100.8018, exactly 3√1129.
Is 10161 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 10161?
10161 is a Harshad number: divisible by its digit sum 9.