The number 82270
82270 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 19 × 433. Divisors (16): 1, 2, 5, 10, 19, 38, 95, 190, 433, 866, 2165, 4330, 8227, 16454, 41135, 82270.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 82270: a Harshad number: divisible by its digit sum 19.
- 2
82270 is composite. Its prime factorisation is
- 3
The divisors add up to 156240; without 82270 itself that is 73970, so 82270 is deficient (73970 is less than 82270). Euler's totient φ(82270) = 31104 numbers up to 82270 share no factor with it.
- 4
The digits of 82270 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 138 steps to reach 1.
LaTeX source of the formulas on this page
\[ 82270 = 2 \times 5 \times 19 \times 433 \]
82270 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 156240 |
| Euler totient φ(n) | 31104 |
| Square | 6768352900 |
| Cube | 556832393083000 |
| Square root | 286.827474 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 138 |
| Scientific notation | 8.227 × |
82270 in other forms
| Form | Value |
|---|---|
| In words | eighty-two thousand two hundred and seventy |
| Binary (base 2) | 10100000101011110 |
| Octal (base 8) | 240536 |
| Hexadecimal (base 16) | 1415E |
| Base 3 | 11011212001 |
| As time | 82270 seconds = 22 h 51 min 10 s |
Is 82270 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (82270 ÷ 2 = 41135) | 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 (82270 ÷ 5 = 16454) | 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 6) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (82270 ÷ 10 = 8227) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 82270 a prime number?
No. 82270 = 2 × 5 × 19 × 433, so it is divisible by 2.
What are the factors of 82270?
1, 2, 5, 10, 19, 38, 95, 190, 433, 866, 2165, 4330, 8227, 16454, 41135, 82270.
What is 82270 in binary?
10100000101011110 (hexadecimal 1415E, octal 240536).
What is the square root of 82270?
About 286.8275.
Is 82270 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 82270?
82270 is a Harshad number: divisible by its digit sum 19.