The number 82951
82951 is a composite number with 4 divisors. Its prime factorisation is 11 × 7541. Divisors (4): 1, 11, 7541, 82951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 82951: a semiprime: 11 × 7541, the product of two primes.
- 2
82951 is composite. Its prime factorisation is
- 3
The divisors add up to 90504; without 82951 itself that is 7553, so 82951 is deficient (7553 is less than 82951). Euler's totient φ(82951) = 75400 numbers up to 82951 share no factor with it.
- 4
The digits of 82951 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 82951 = 11 \times 7541 \]
82951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 90504 |
| Euler totient φ(n) | 75400 |
| Square | 6880868401 |
| Cube | 570774914731351 |
| Square root | 288.012153 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 89 |
| Scientific notation | 8.2951 × |
82951 in other forms
| Form | Value |
|---|---|
| In words | eighty-two thousand nine hundred and fifty-one |
| Binary (base 2) | 10100010000000111 |
| Octal (base 8) | 242007 |
| Hexadecimal (base 16) | 14407 |
| Base 3 | 11012210021 |
| As time | 82951 seconds = 23 h 2 min 31 s |
Is 82951 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 1) | 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 1) | 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 7) | 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 | Yes (82951 ÷ 11 = 7541) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 82951 a prime number?
No. 82951 = 11 × 7541, so it is divisible by 11.
What are the factors of 82951?
1, 11, 7541, 82951.
What is 82951 in binary?
10100010000000111 (hexadecimal 14407, octal 242007).
What is the square root of 82951?
About 288.0122.
Is 82951 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 82951?
82951 is a semiprime: 11 × 7541, the product of two primes.