The number 82641
82641 is a composite number with 12 divisors. Its prime factorisation is 3 × × 163. Divisors (12): 1, 3, 13, 39, 163, 169, 489, 507, 2119, 6357, 27547, 82641.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
82641 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
82641 is composite. Its prime factorisation is
- 3
The divisors add up to 120048; without 82641 itself that is 37407, so 82641 is deficient (37407 is less than 82641). Euler's totient φ(82641) = 50544 numbers up to 82641 share no factor with it.
- 4
The digits of 82641 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 120 steps to reach 1.
LaTeX source of the formulas on this page
\[ 82641 = 3 \times 13^{2} \times 163 \]82641 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 120048 |
| Euler totient φ(n) | 50544 |
| Square | 6829534881 |
| Cube | 564399592100721 |
| Square root | 287.473477 (= 13√489) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 120 |
| Scientific notation | 8.2641 × |
82641 in other forms
| Form | Value |
|---|---|
| In words | eighty-two thousand six hundred and forty-one |
| Binary (base 2) | 10100001011010001 |
| Octal (base 8) | 241321 |
| Hexadecimal (base 16) | 142D1 |
| Base 3 | 11012100210 |
| As time | 82641 seconds = 22 h 57 min 21 s |
Is 82641 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 (82641 ÷ 3 = 27547) | 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 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 3) | 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 9) | 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 82641 a prime number?
No. 82641 = 3 × × 163, so it is divisible by 3.
What are the factors of 82641?
1, 3, 13, 39, 163, 169, 489, 507, 2119, 6357, 27547, 82641.
What is 82641 in binary?
10100001011010001 (hexadecimal 142D1, octal 241321).
What is the square root of 82641?
About 287.4735, exactly 13√489.
Is 82641 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 82641?
It is a composite number with 12 divisors.