The number 48560
48560 is a composite number with 20 divisors. Its prime factorisation is × 5 × 607. Divisors (20): 1, 2, 4, 5, 8, 10, 16, 20, 40, 80, 607, 1214, 2428, 3035, 4856, 6070 … 48560.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48560 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48560 is composite. Its prime factorisation is
- 3
The divisors add up to 113088; without 48560 itself that is 64528, so 48560 is abundant (64528 is more than 48560). Euler's totient φ(48560) = 19392 numbers up to 48560 share no factor with it.
- 4
The digits of 48560 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48560 = 2^{4} \times 5 \times 607 \]48560 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 113088 |
| Euler totient φ(n) | 19392 |
| Square | 2358073600 |
| Cube | 114508054016000 |
| Square root | 220.363336 (= 4√3035) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.856 × |
48560 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and sixty |
| Binary (base 2) | 1011110110110000 |
| Octal (base 8) | 136660 |
| Hexadecimal (base 16) | BDB0 |
| Base 3 | 2110121112 |
| As time | 48560 seconds = 13 h 29 min 20 s |
Is 48560 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48560 ÷ 2 = 24280) | 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 (48560 ÷ 4 = 12140) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (48560 ÷ 5 = 9712) | 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 | Yes (48560 ÷ 8 = 6070) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (48560 ÷ 10 = 4856) | 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 48560 a prime number?
No. 48560 = × 5 × 607, so it is divisible by 2.
What are the factors of 48560?
1, 2, 4, 5, 8, 10, 16, 20, 40, 80, 607, 1214, 2428, 3035, 4856, 6070, 9712, 12140, 24280, 48560.
What is 48560 in binary?
1011110110110000 (hexadecimal BDB0, octal 136660).
What is the square root of 48560?
About 220.3633, exactly 4√3035.
Is 48560 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 48560?
It is a composite number with 20 divisors.