The number 48010
48010 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 4801. Divisors (8): 1, 2, 5, 10, 4801, 9602, 24005, 48010.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48010 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48010 is composite. Its prime factorisation is
- 3
The divisors add up to 86436; without 48010 itself that is 38426, so 48010 is deficient (38426 is less than 48010). Euler's totient φ(48010) = 19200 numbers up to 48010 share no factor with it.
- 4
The digits of 48010 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48010 = 2 \times 5 \times 4801 \]
48010 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 86436 |
| Euler totient φ(n) | 19200 |
| Square | 2304960100 |
| Cube | 110661134401000 |
| Square root | 219.111844 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.801 × |
48010 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand and ten |
| Binary (base 2) | 1011101110001010 |
| Octal (base 8) | 135612 |
| Hexadecimal (base 16) | BB8A |
| Base 3 | 2102212011 |
| As time | 48010 seconds = 13 h 20 min 10 s |
Is 48010 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48010 ÷ 2 = 24005) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (48010 ÷ 5 = 9602) | 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 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 | No (remainder 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (48010 ÷ 10 = 4801) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48010 a prime number?
No. 48010 = 2 × 5 × 4801, so it is divisible by 2.
What are the factors of 48010?
1, 2, 5, 10, 4801, 9602, 24005, 48010.
What is 48010 in binary?
1011101110001010 (hexadecimal BB8A, octal 135612).
What is the square root of 48010?
About 219.1118.
Is 48010 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 48010?
It is a composite number with 8 divisors.