The number 82748
82748 is a composite number with 12 divisors. Its prime factorisation is × 137 × 151. Divisors (12): 1, 2, 4, 137, 151, 274, 302, 548, 604, 20687, 41374, 82748.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
82748 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
82748 is composite. Its prime factorisation is
- 3
The divisors add up to 146832; without 82748 itself that is 64084, so 82748 is deficient (64084 is less than 82748). Euler's totient φ(82748) = 40800 numbers up to 82748 share no factor with it.
- 4
The digits of 82748 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 82748 = 2^{2} \times 137 \times 151 \]82748 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 146832 |
| Euler totient φ(n) | 40800 |
| Square | 6847231504 |
| Cube | 566594712492992 |
| Square root | 287.659521 (= 2√20687) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 89 |
| Scientific notation | 8.2748 × |
82748 in other forms
| Form | Value |
|---|---|
| In words | eighty-two thousand seven hundred and forty-eight |
| Binary (base 2) | 10100001100111100 |
| Octal (base 8) | 241474 |
| Hexadecimal (base 16) | 1433C |
| Base 3 | 11012111202 |
| As time | 82748 seconds = 22 h 59 min 8 s |
Is 82748 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (82748 ÷ 2 = 41374) | 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 (82748 ÷ 4 = 20687) | 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 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 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 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 82748 a prime number?
No. 82748 = × 137 × 151, so it is divisible by 2.
What are the factors of 82748?
1, 2, 4, 137, 151, 274, 302, 548, 604, 20687, 41374, 82748.
What is 82748 in binary?
10100001100111100 (hexadecimal 1433C, octal 241474).
What is the square root of 82748?
About 287.6595, exactly 2√20687.
Is 82748 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 82748?
It is a composite number with 12 divisors.