The number 82268
82268 is a composite number with 12 divisors. Its prime factorisation is × 131 × 157. Divisors (12): 1, 2, 4, 131, 157, 262, 314, 524, 628, 20567, 41134, 82268.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
82268 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
82268 is composite. Its prime factorisation is
- 3
The divisors add up to 145992; without 82268 itself that is 63724, so 82268 is deficient (63724 is less than 82268). Euler's totient φ(82268) = 40560 numbers up to 82268 share no factor with it.
- 4
The digits of 82268 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 82268 = 2^{2} \times 131 \times 157 \]82268 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 145992 |
| Euler totient φ(n) | 40560 |
| Square | 6768023824 |
| Cube | 556791783952832 |
| Square root | 286.823988 (= 2√20567) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 89 |
| Scientific notation | 8.2268 × |
82268 in other forms
| Form | Value |
|---|---|
| In words | eighty-two thousand two hundred and sixty-eight |
| Binary (base 2) | 10100000101011100 |
| Octal (base 8) | 240534 |
| Hexadecimal (base 16) | 1415C |
| Base 3 | 11011211222 |
| As time | 82268 seconds = 22 h 51 min 8 s |
Is 82268 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (82268 ÷ 2 = 41134) | 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 (82268 ÷ 4 = 20567) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 | No (remainder 4) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 82268 a prime number?
No. 82268 = × 131 × 157, so it is divisible by 2.
What are the factors of 82268?
1, 2, 4, 131, 157, 262, 314, 524, 628, 20567, 41134, 82268.
What is 82268 in binary?
10100000101011100 (hexadecimal 1415C, octal 240534).
What is the square root of 82268?
About 286.8240, exactly 2√20567.
Is 82268 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 82268?
It is a composite number with 12 divisors.