The number 48582
48582 is a composite number with 12 divisors. Its prime factorisation is 2 × × 2699. Divisors (12): 1, 2, 3, 6, 9, 18, 2699, 5398, 8097, 16194, 24291, 48582.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48582 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48582 is composite. Its prime factorisation is
- 3
The divisors add up to 105300; without 48582 itself that is 56718, so 48582 is abundant (56718 is more than 48582). Euler's totient φ(48582) = 16188 numbers up to 48582 share no factor with it.
- 4
The digits of 48582 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48582 = 2 \times 3^{2} \times 2699 \]48582 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 105300 |
| Euler totient φ(n) | 16188 |
| Square | 2360210724 |
| Cube | 114663757393368 |
| Square root | 220.413248 (= 3√5398) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.8582 × |
48582 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and eighty-two |
| Binary (base 2) | 1011110111000110 |
| Octal (base 8) | 136706 |
| Hexadecimal (base 16) | BDC6 |
| Base 3 | 2110122100 |
| As time | 48582 seconds = 13 h 29 min 42 s |
Is 48582 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48582 ÷ 2 = 24291) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (48582 ÷ 3 = 16194) | 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 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (48582 ÷ 6 = 8097) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 | Yes (48582 ÷ 9 = 5398) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48582 a prime number?
No. 48582 = 2 × × 2699, so it is divisible by 2.
What are the factors of 48582?
1, 2, 3, 6, 9, 18, 2699, 5398, 8097, 16194, 24291, 48582.
What is 48582 in binary?
1011110111000110 (hexadecimal BDC6, octal 136706).
What is the square root of 48582?
About 220.4132, exactly 3√5398.
Is 48582 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 48582?
It is a composite number with 12 divisors.