The number 82230
82230 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 2741. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 2741, 5482, 8223, 13705, 16446, 27410, 41115, 82230.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 82230: a Harshad number: divisible by its digit sum 15.
- 2
82230 is composite. Its prime factorisation is
- 3
The divisors add up to 197424; without 82230 itself that is 115194, so 82230 is abundant (115194 is more than 82230). Euler's totient φ(82230) = 21920 numbers up to 82230 share no factor with it.
- 4
The digits of 82230 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 138 steps to reach 1.
LaTeX source of the formulas on this page
\[ 82230 = 2 \times 3 \times 5 \times 2741 \]
82230 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 197424 |
| Euler totient φ(n) | 21920 |
| Square | 6761772900 |
| Cube | 556020585567000 |
| Square root | 286.757737 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 138 |
| Scientific notation | 8.223 × |
82230 in other forms
| Form | Value |
|---|---|
| In words | eighty-two thousand two hundred and thirty |
| Binary (base 2) | 10100000100110110 |
| Octal (base 8) | 240466 |
| Hexadecimal (base 16) | 14136 |
| Base 3 | 11011210120 |
| As time | 82230 seconds = 22 h 50 min 30 s |
Is 82230 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (82230 ÷ 2 = 41115) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (82230 ÷ 3 = 27410) | 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 (82230 ÷ 5 = 16446) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (82230 ÷ 6 = 13705) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (82230 ÷ 10 = 8223) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 82230 a prime number?
No. 82230 = 2 × 3 × 5 × 2741, so it is divisible by 2.
What are the factors of 82230?
1, 2, 3, 5, 6, 10, 15, 30, 2741, 5482, 8223, 13705, 16446, 27410, 41115, 82230.
What is 82230 in binary?
10100000100110110 (hexadecimal 14136, octal 240466).
What is the square root of 82230?
About 286.7577.
Is 82230 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 82230?
82230 is a Harshad number: divisible by its digit sum 15.