The number 82152
82152 is a composite number with 48 divisors. Its prime factorisation is × × 7 × 163. Divisors (48): 1, 2, 3, 4, 6, 7, 8, 9, 12, 14, 18, 21, 24, 28, 36, 42 … 82152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 82152: a Harshad number: divisible by its digit sum 18.
- 2
82152 is composite. Its prime factorisation is
- 3
The divisors add up to 255840; without 82152 itself that is 173688, so 82152 is abundant (173688 is more than 82152). Euler's totient φ(82152) = 23328 numbers up to 82152 share no factor with it.
- 4
The digits of 82152 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 82152 = 2^{3} \times 3^{2} \times 7 \times 163 \]82152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 255840 |
| Euler totient φ(n) | 23328 |
| Square | 6748951104 |
| Cube | 554439831095808 |
| Square root | 286.621702 (= 6√2282) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 151 |
| Scientific notation | 8.2152 × |
82152 in other forms
| Form | Value |
|---|---|
| In words | eighty-two thousand one hundred and fifty-two |
| Binary (base 2) | 10100000011101000 |
| Octal (base 8) | 240350 |
| Hexadecimal (base 16) | 140E8 |
| Base 3 | 11011200200 |
| As time | 82152 seconds = 22 h 49 min 12 s |
Is 82152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (82152 ÷ 2 = 41076) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (82152 ÷ 3 = 27384) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (82152 ÷ 4 = 20538) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (82152 ÷ 6 = 13692) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (82152 ÷ 7 = 11736) | 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 | Yes (82152 ÷ 8 = 10269) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (82152 ÷ 9 = 9128) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 | Yes (82152 ÷ 12 = 6846) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 82152 a prime number?
No. 82152 = × × 7 × 163, so it is divisible by 2.
What are the factors of 82152?
1, 2, 3, 4, 6, 7, 8, 9, 12, 14, 18, 21, 24, 28, 36, 42, 56, 63, 72, 84, 126, 163, 168, 252, 326, 489, 504, 652, 978, 1141, 1304, 1467, 1956, 2282, 2934, 3423, 3912, 4564, 5868, 6846, 9128, 10269, 11736, 13692, 20538, 27384, 41076, 82152.
What is 82152 in binary?
10100000011101000 (hexadecimal 140E8, octal 240350).
What is the square root of 82152?
About 286.6217, exactly 6√2282.
Is 82152 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 82152?
82152 is a Harshad number: divisible by its digit sum 18.