The number 48520
48520 is a composite number with 16 divisors. Its prime factorisation is × 5 × 1213. Divisors (16): 1, 2, 4, 5, 8, 10, 20, 40, 1213, 2426, 4852, 6065, 9704, 12130, 24260, 48520.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48520: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
48520 is composite. Its prime factorisation is
- 3
The divisors add up to 109260; without 48520 itself that is 60740, so 48520 is abundant (60740 is more than 48520). Euler's totient φ(48520) = 19392 numbers up to 48520 share no factor with it.
- 4
The digits of 48520 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 26 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48520 = 2^{3} \times 5 \times 1213 \]48520 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 109260 |
| Euler totient φ(n) | 19392 |
| Square | 2354190400 |
| Cube | 114225318208000 |
| Square root | 220.272558 (= 2√12130) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 26 |
| Scientific notation | 4.852 × |
48520 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and twenty |
| Binary (base 2) | 1011110110001000 |
| Octal (base 8) | 136610 |
| Hexadecimal (base 16) | BD88 |
| Base 3 | 2110120001 |
| As time | 48520 seconds = 13 h 28 min 40 s |
Is 48520 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48520 ÷ 2 = 24260) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (48520 ÷ 4 = 12130) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (48520 ÷ 5 = 9704) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 (48520 ÷ 8 = 6065) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (48520 ÷ 10 = 4852) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48520 a prime number?
No. 48520 = × 5 × 1213, so it is divisible by 2.
What are the factors of 48520?
1, 2, 4, 5, 8, 10, 20, 40, 1213, 2426, 4852, 6065, 9704, 12130, 24260, 48520.
What is 48520 in binary?
1011110110001000 (hexadecimal BD88, octal 136610).
What is the square root of 48520?
About 220.2726, exactly 2√12130.
Is 48520 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 48520?
48520 is a happy number: repeatedly adding the squares of its digits reaches 1.