The number 48080
48080 is a composite number with 20 divisors. Its prime factorisation is × 5 × 601. Divisors (20): 1, 2, 4, 5, 8, 10, 16, 20, 40, 80, 601, 1202, 2404, 3005, 4808, 6010 … 48080.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48080: a Harshad number: divisible by its digit sum 20.
- 2
48080 is composite. Its prime factorisation is
- 3
The divisors add up to 111972; without 48080 itself that is 63892, so 48080 is abundant (63892 is more than 48080). Euler's totient φ(48080) = 19200 numbers up to 48080 share no factor with it.
- 4
The digits of 48080 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 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48080 = 2^{4} \times 5 \times 601 \]48080 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 111972 |
| Euler totient φ(n) | 19200 |
| Square | 2311686400 |
| Cube | 111145882112000 |
| Square root | 219.271521 (= 4√3005) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.808 × |
48080 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand and eighty |
| Binary (base 2) | 1011101111010000 |
| Octal (base 8) | 135720 |
| Hexadecimal (base 16) | BBD0 |
| Base 3 | 2102221202 |
| As time | 48080 seconds = 13 h 21 min 20 s |
Is 48080 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48080 ÷ 2 = 24040) | 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 (48080 ÷ 4 = 12020) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (48080 ÷ 5 = 9616) | 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 4) | 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 (48080 ÷ 8 = 6010) | 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 (48080 ÷ 10 = 4808) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48080 a prime number?
No. 48080 = × 5 × 601, so it is divisible by 2.
What are the factors of 48080?
1, 2, 4, 5, 8, 10, 16, 20, 40, 80, 601, 1202, 2404, 3005, 4808, 6010, 9616, 12020, 24040, 48080.
What is 48080 in binary?
1011101111010000 (hexadecimal BBD0, octal 135720).
What is the square root of 48080?
About 219.2715, exactly 4√3005.
Is 48080 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 48080?
48080 is a Harshad number: divisible by its digit sum 20.