The number 48530
48530 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 23 × 211. Divisors (16): 1, 2, 5, 10, 23, 46, 115, 211, 230, 422, 1055, 2110, 4853, 9706, 24265, 48530.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48530 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48530 is composite. Its prime factorisation is
- 3
The divisors add up to 91584; without 48530 itself that is 43054, so 48530 is deficient (43054 is less than 48530). Euler's totient φ(48530) = 18480 numbers up to 48530 share no factor with it.
- 4
The digits of 48530 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 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48530 = 2 \times 5 \times 23 \times 211 \]
48530 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 91584 |
| Euler totient φ(n) | 18480 |
| Square | 2355160900 |
| Cube | 114295958477000 |
| Square root | 220.295256 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 127 |
| Scientific notation | 4.853 × |
48530 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and thirty |
| Binary (base 2) | 1011110110010010 |
| Octal (base 8) | 136622 |
| Hexadecimal (base 16) | BD92 |
| Base 3 | 2110120102 |
| As time | 48530 seconds = 13 h 28 min 50 s |
Is 48530 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48530 ÷ 2 = 24265) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (48530 ÷ 5 = 9706) | 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 6) | 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 2) | 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 (48530 ÷ 10 = 4853) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48530 a prime number?
No. 48530 = 2 × 5 × 23 × 211, so it is divisible by 2.
What are the factors of 48530?
1, 2, 5, 10, 23, 46, 115, 211, 230, 422, 1055, 2110, 4853, 9706, 24265, 48530.
What is 48530 in binary?
1011110110010010 (hexadecimal BD92, octal 136622).
What is the square root of 48530?
About 220.2953.
Is 48530 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 48530?
It is a composite number with 16 divisors.