The number 81641
81641 is a composite number with 8 divisors. Its prime factorisation is 7 × 107 × 109. Divisors (8): 1, 7, 107, 109, 749, 763, 11663, 81641.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
81641 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
81641 is composite. Its prime factorisation is
- 3
The divisors add up to 95040; without 81641 itself that is 13399, so 81641 is deficient (13399 is less than 81641). Euler's totient φ(81641) = 68688 numbers up to 81641 share no factor with it.
- 4
The digits of 81641 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 182 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81641 = 7 \times 107 \times 109 \]
81641 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 95040 |
| Euler totient φ(n) | 68688 |
| Square | 6665252881 |
| Cube | 544157910457721 |
| Square root | 285.728892 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 182 |
| Scientific notation | 8.1641 × |
81641 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand six hundred and forty-one |
| Binary (base 2) | 10011111011101001 |
| Octal (base 8) | 237351 |
| Hexadecimal (base 16) | 13EE9 |
| Base 3 | 11010222202 |
| As time | 81641 seconds = 22 h 40 min 41 s |
Is 81641 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 | Yes (81641 ÷ 7 = 11663) | 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 2) | 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 10) | 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 81641 a prime number?
No. 81641 = 7 × 107 × 109, so it is divisible by 7.
What are the factors of 81641?
1, 7, 107, 109, 749, 763, 11663, 81641.
What is 81641 in binary?
10011111011101001 (hexadecimal 13EE9, octal 237351).
What is the square root of 81641?
About 285.7289.
Is 81641 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 81641?
It is a composite number with 8 divisors.