The number 82460
82460 is a composite number with 48 divisors. Its prime factorisation is × 5 × 7 × 19 × 31. Divisors (48): 1, 2, 4, 5, 7, 10, 14, 19, 20, 28, 31, 35, 38, 62, 70, 76 … 82460.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 82460: a Harshad number: divisible by its digit sum 20.
- 2
82460 is composite. Its prime factorisation is
- 3
The divisors add up to 215040; without 82460 itself that is 132580, so 82460 is abundant (132580 is more than 82460). Euler's totient φ(82460) = 25920 numbers up to 82460 share no factor with it.
- 4
The digits of 82460 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 213 steps to reach 1.
LaTeX source of the formulas on this page
\[ 82460 = 2^{2} \times 5 \times 7 \times 19 \times 31 \]82460 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 215040 |
| Euler totient φ(n) | 25920 |
| Square | 6799651600 |
| Cube | 560699270936000 |
| Square root | 287.158493 (= 2√20615) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 213 |
| Scientific notation | 8.246 × |
82460 in other forms
| Form | Value |
|---|---|
| In words | eighty-two thousand four hundred and sixty |
| Binary (base 2) | 10100001000011100 |
| Octal (base 8) | 241034 |
| Hexadecimal (base 16) | 1421C |
| Base 3 | 11012010002 |
| As time | 82460 seconds = 22 h 54 min 20 s |
Is 82460 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (82460 ÷ 2 = 41230) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (82460 ÷ 4 = 20615) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (82460 ÷ 5 = 16492) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (82460 ÷ 7 = 11780) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (82460 ÷ 10 = 8246) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 82460 a prime number?
No. 82460 = × 5 × 7 × 19 × 31, so it is divisible by 2.
What are the factors of 82460?
1, 2, 4, 5, 7, 10, 14, 19, 20, 28, 31, 35, 38, 62, 70, 76, 95, 124, 133, 140, 155, 190, 217, 266, 310, 380, 434, 532, 589, 620, 665, 868, 1085, 1178, 1330, 2170, 2356, 2660, 2945, 4123, 4340, 5890, 8246, 11780, 16492, 20615, 41230, 82460.
What is 82460 in binary?
10100001000011100 (hexadecimal 1421C, octal 241034).
What is the square root of 82460?
About 287.1585, exactly 2√20615.
Is 82460 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 82460?
82460 is a Harshad number: divisible by its digit sum 20.