The number 82390
82390 is a composite number with 32 divisors. Its prime factorisation is 2 × 5 × 7 × 11 × 107. Divisors (32): 1, 2, 5, 7, 10, 11, 14, 22, 35, 55, 70, 77, 107, 110, 154, 214 … 82390.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 82390: a Harshad number: divisible by its digit sum 22.
- 2
82390 is composite. Its prime factorisation is
- 3
The divisors add up to 186624; without 82390 itself that is 104234, so 82390 is abundant (104234 is more than 82390). Euler's totient φ(82390) = 25440 numbers up to 82390 share no factor with it.
- 4
The digits of 82390 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 82390 = 2 \times 5 \times 7 \times 11 \times 107 \]
82390 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 186624 |
| Euler totient φ(n) | 25440 |
| Square | 6788112100 |
| Cube | 559272555919000 |
| Square root | 287.036583 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 151 |
| Scientific notation | 8.239 × |
82390 in other forms
| Form | Value |
|---|---|
| In words | eighty-two thousand three hundred and ninety |
| Binary (base 2) | 10100000111010110 |
| Octal (base 8) | 240726 |
| Hexadecimal (base 16) | 141D6 |
| Base 3 | 11012000111 |
| As time | 82390 seconds = 22 h 53 min 10 s |
Is 82390 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (82390 ÷ 2 = 41195) | 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 | Yes (82390 ÷ 5 = 16478) | 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 | Yes (82390 ÷ 7 = 11770) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (82390 ÷ 10 = 8239) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (82390 ÷ 11 = 7490) | 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 82390 a prime number?
No. 82390 = 2 × 5 × 7 × 11 × 107, so it is divisible by 2.
What are the factors of 82390?
1, 2, 5, 7, 10, 11, 14, 22, 35, 55, 70, 77, 107, 110, 154, 214, 385, 535, 749, 770, 1070, 1177, 1498, 2354, 3745, 5885, 7490, 8239, 11770, 16478, 41195, 82390.
What is 82390 in binary?
10100000111010110 (hexadecimal 141D6, octal 240726).
What is the square root of 82390?
About 287.0366.
Is 82390 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 82390?
82390 is a Harshad number: divisible by its digit sum 22.