The number 81161
81161 is a composite number with 4 divisors. Its prime factorisation is 277 × 293. Divisors (4): 1, 277, 293, 81161.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 81161: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 277 × 293, the product of two primes.
- 2
81161 is composite. Its prime factorisation is
- 3
The divisors add up to 81732; without 81161 itself that is 571, so 81161 is deficient (571 is less than 81161). Euler's totient φ(81161) = 80592 numbers up to 81161 share no factor with it.
- 4
The digits of 81161 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81161 = 277 \times 293 \]
81161 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 81732 |
| Euler totient φ(n) | 80592 |
| Square | 6587107921 |
| Cube | 534616265976281 |
| Square root | 284.887697 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 89 |
| Scientific notation | 8.1161 × |
81161 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand one hundred and sixty-one |
| Binary (base 2) | 10011110100001001 |
| Octal (base 8) | 236411 |
| Hexadecimal (base 16) | 13D09 |
| Base 3 | 11010022222 |
| As time | 81161 seconds = 22 h 32 min 41 s |
Is 81161 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 8) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81161 a prime number?
No. 81161 = 277 × 293, so it is divisible by 277.
What are the factors of 81161?
1, 277, 293, 81161.
What is 81161 in binary?
10011110100001001 (hexadecimal 13D09, octal 236411).
What is the square root of 81161?
About 284.8877.
Is 81161 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 81161?
81161 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 277 × 293, the product of two primes.