The number 82751
82751 is a composite number with 4 divisors. Its prime factorisation is 83 × 997. Divisors (4): 1, 83, 997, 82751.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 82751: a semiprime: 83 × 997, the product of two primes.
- 2
82751 is composite. Its prime factorisation is
- 3
The divisors add up to 83832; without 82751 itself that is 1081, so 82751 is deficient (1081 is less than 82751). Euler's totient φ(82751) = 81672 numbers up to 82751 share no factor with it.
- 4
The digits of 82751 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 182 steps to reach 1.
LaTeX source of the formulas on this page
\[ 82751 = 83 \times 997 \]
82751 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 83832 |
| Euler totient φ(n) | 81672 |
| Square | 6847728001 |
| Cube | 566656339810751 |
| Square root | 287.664735 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 182 |
| Scientific notation | 8.2751 × |
82751 in other forms
| Form | Value |
|---|---|
| In words | eighty-two thousand seven hundred and fifty-one |
| Binary (base 2) | 10100001100111111 |
| Octal (base 8) | 241477 |
| Hexadecimal (base 16) | 1433F |
| Base 3 | 11012111212 |
| As time | 82751 seconds = 22 h 59 min 11 s |
Is 82751 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 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 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 9) | 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 82751 a prime number?
No. 82751 = 83 × 997, so it is divisible by 83.
What are the factors of 82751?
1, 83, 997, 82751.
What is 82751 in binary?
10100001100111111 (hexadecimal 1433F, octal 241477).
What is the square root of 82751?
About 287.6647.
Is 82751 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 82751?
82751 is a semiprime: 83 × 997, the product of two primes.