The number 48580
48580 is a composite number with 24 divisors. Its prime factorisation is × 5 × 7 × 347. Divisors (24): 1, 2, 4, 5, 7, 10, 14, 20, 28, 35, 70, 140, 347, 694, 1388, 1735 … 48580.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48580 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48580 is composite. Its prime factorisation is
- 3
The divisors add up to 116928; without 48580 itself that is 68348, so 48580 is abundant (68348 is more than 48580). Euler's totient φ(48580) = 16608 numbers up to 48580 share no factor with it.
- 4
The digits of 48580 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48580 = 2^{2} \times 5 \times 7 \times 347 \]48580 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 116928 |
| Euler totient φ(n) | 16608 |
| Square | 2360016400 |
| Cube | 114649596712000 |
| Square root | 220.408711 (= 2√12145) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.858 × |
48580 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and eighty |
| Binary (base 2) | 1011110111000100 |
| Octal (base 8) | 136704 |
| Hexadecimal (base 16) | BDC4 |
| Base 3 | 2110122021 |
| As time | 48580 seconds = 13 h 29 min 40 s |
Is 48580 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48580 ÷ 2 = 24290) | 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 (48580 ÷ 4 = 12145) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (48580 ÷ 5 = 9716) | 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 | Yes (48580 ÷ 7 = 6940) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (48580 ÷ 10 = 4858) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 48580 a prime number?
No. 48580 = × 5 × 7 × 347, so it is divisible by 2.
What are the factors of 48580?
1, 2, 4, 5, 7, 10, 14, 20, 28, 35, 70, 140, 347, 694, 1388, 1735, 2429, 3470, 4858, 6940, 9716, 12145, 24290, 48580.
What is 48580 in binary?
1011110111000100 (hexadecimal BDC4, octal 136704).
What is the square root of 48580?
About 220.4087, exactly 2√12145.
Is 48580 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 48580?
It is a composite number with 24 divisors.