The number 82162
82162 is a composite number with 4 divisors. Its prime factorisation is 2 × 41081. Divisors (4): 1, 2, 41081, 82162.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 82162: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 41081, the product of two primes.
- 2
82162 is composite. Its prime factorisation is
- 3
The divisors add up to 123246; without 82162 itself that is 41084, so 82162 is deficient (41084 is less than 82162). Euler's totient φ(82162) = 41080 numbers up to 82162 share no factor with it.
- 4
The digits of 82162 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 182 steps to reach 1.
LaTeX source of the formulas on this page
\[ 82162 = 2 \times 41081 \]
82162 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 123246 |
| Euler totient φ(n) | 41080 |
| Square | 6750594244 |
| Cube | 554642324275528 |
| Square root | 286.639146 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 182 |
| Scientific notation | 8.2162 × |
82162 in other forms
| Form | Value |
|---|---|
| In words | eighty-two thousand one hundred and sixty-two |
| Binary (base 2) | 10100000011110010 |
| Octal (base 8) | 240362 |
| Hexadecimal (base 16) | 140F2 |
| Base 3 | 11011201001 |
| As time | 82162 seconds = 22 h 49 min 22 s |
Is 82162 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (82162 ÷ 2 = 41081) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 82162 a prime number?
No. 82162 = 2 × 41081, so it is divisible by 2.
What are the factors of 82162?
1, 2, 41081, 82162.
What is 82162 in binary?
10100000011110010 (hexadecimal 140F2, octal 240362).
What is the square root of 82162?
About 286.6391.
Is 82162 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 82162?
82162 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 41081, the product of two primes.