The number 82391
82391 is a composite number with 4 divisors. Its prime factorisation is 47 × 1753. Divisors (4): 1, 47, 1753, 82391.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 82391: a semiprime: 47 × 1753, the product of two primes.
- 2
82391 is composite. Its prime factorisation is
- 3
The divisors add up to 84192; without 82391 itself that is 1801, so 82391 is deficient (1801 is less than 82391). Euler's totient φ(82391) = 80592 numbers up to 82391 share no factor with it.
- 4
The digits of 82391 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 82391 = 47 \times 1753 \]
82391 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 84192 |
| Euler totient φ(n) | 80592 |
| Square | 6788276881 |
| Cube | 559292920502471 |
| Square root | 287.038325 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 151 |
| Scientific notation | 8.2391 × |
82391 in other forms
| Form | Value |
|---|---|
| In words | eighty-two thousand three hundred and ninety-one |
| Binary (base 2) | 10100000111010111 |
| Octal (base 8) | 240727 |
| Hexadecimal (base 16) | 141D7 |
| Base 3 | 11012000112 |
| As time | 82391 seconds = 22 h 53 min 11 s |
Is 82391 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 3) | 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 1) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 82391 a prime number?
No. 82391 = 47 × 1753, so it is divisible by 47.
What are the factors of 82391?
1, 47, 1753, 82391.
What is 82391 in binary?
10100000111010111 (hexadecimal 141D7, octal 240727).
What is the square root of 82391?
About 287.0383.
Is 82391 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 82391?
82391 is a semiprime: 47 × 1753, the product of two primes.