The number 48522
48522 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 8087. Divisors (8): 1, 2, 3, 6, 8087, 16174, 24261, 48522.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48522 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48522 is composite. Its prime factorisation is
- 3
The divisors add up to 97056; without 48522 itself that is 48534, so 48522 is abundant (48534 is more than 48522). Euler's totient φ(48522) = 16172 numbers up to 48522 share no factor with it.
- 4
The digits of 48522 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 26 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48522 = 2 \times 3 \times 8087 \]
48522 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 97056 |
| Euler totient φ(n) | 16172 |
| Square | 2354384484 |
| Cube | 114239443932648 |
| Square root | 220.277098 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 26 |
| Scientific notation | 4.8522 × |
48522 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and twenty-two |
| Binary (base 2) | 1011110110001010 |
| Octal (base 8) | 136612 |
| Hexadecimal (base 16) | BD8A |
| Base 3 | 2110120010 |
| As time | 48522 seconds = 13 h 28 min 42 s |
Is 48522 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48522 ÷ 2 = 24261) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (48522 ÷ 3 = 16174) | 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 (48522 ÷ 6 = 8087) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 3) | 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 1) | 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 48522 a prime number?
No. 48522 = 2 × 3 × 8087, so it is divisible by 2.
What are the factors of 48522?
1, 2, 3, 6, 8087, 16174, 24261, 48522.
What is 48522 in binary?
1011110110001010 (hexadecimal BD8A, octal 136612).
What is the square root of 48522?
About 220.2771.
Is 48522 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 48522?
It is a composite number with 8 divisors.