The number 48050
48050 is a composite number with 18 divisors. Its prime factorisation is 2 × × . Divisors (18): 1, 2, 5, 10, 25, 31, 50, 62, 155, 310, 775, 961, 1550, 1922, 4805, 9610 … 48050.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48050 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48050 is composite. Its prime factorisation is
- 3
The divisors add up to 92349; without 48050 itself that is 44299, so 48050 is deficient (44299 is less than 48050). Euler's totient φ(48050) = 18600 numbers up to 48050 share no factor with it.
- 4
The digits of 48050 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 44 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48050 = 2 \times 5^{2} \times 31^{2} \]48050 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 92349 |
| Euler totient φ(n) | 18600 |
| Square | 2308802500 |
| Cube | 110937960125000 |
| Square root | 219.203102 (= 155√2) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 44 |
| Scientific notation | 4.805 × |
48050 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand and fifty |
| Binary (base 2) | 1011101110110010 |
| Octal (base 8) | 135662 |
| Hexadecimal (base 16) | BBB2 |
| Base 3 | 2102220122 |
| As time | 48050 seconds = 13 h 20 min 50 s |
Is 48050 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48050 ÷ 2 = 24025) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (48050 ÷ 5 = 9610) | 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 2) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (48050 ÷ 10 = 4805) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48050 a prime number?
No. 48050 = 2 × × , so it is divisible by 2.
What are the factors of 48050?
1, 2, 5, 10, 25, 31, 50, 62, 155, 310, 775, 961, 1550, 1922, 4805, 9610, 24025, 48050.
What is 48050 in binary?
1011101110110010 (hexadecimal BBB2, octal 135662).
What is the square root of 48050?
About 219.2031, exactly 155√2.
Is 48050 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 48050?
It is a composite number with 18 divisors.