The number 48051
48051 is a composite number with 12 divisors. Its prime factorisation is × 19 × 281. Divisors (12): 1, 3, 9, 19, 57, 171, 281, 843, 2529, 5339, 16017, 48051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48051 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48051 is composite. Its prime factorisation is
- 3
The divisors add up to 73320; without 48051 itself that is 25269, so 48051 is deficient (25269 is less than 48051). Euler's totient φ(48051) = 30240 numbers up to 48051 share no factor with it.
- 4
The digits of 48051 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 44 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48051 = 3^{2} \times 19 \times 281 \]48051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 73320 |
| Euler totient φ(n) | 30240 |
| Square | 2308898601 |
| Cube | 110944886676651 |
| Square root | 219.205383 (= 3√5339) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 44 |
| Scientific notation | 4.8051 × |
48051 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand and fifty-one |
| Binary (base 2) | 1011101110110011 |
| Octal (base 8) | 135663 |
| Hexadecimal (base 16) | BBB3 |
| Base 3 | 2102220200 |
| As time | 48051 seconds = 13 h 20 min 51 s |
Is 48051 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (48051 ÷ 3 = 16017) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (48051 ÷ 9 = 5339) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48051 a prime number?
No. 48051 = × 19 × 281, so it is divisible by 3.
What are the factors of 48051?
1, 3, 9, 19, 57, 171, 281, 843, 2529, 5339, 16017, 48051.
What is 48051 in binary?
1011101110110011 (hexadecimal BBB3, octal 135663).
What is the square root of 48051?
About 219.2054, exactly 3√5339.
Is 48051 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 48051?
It is a composite number with 12 divisors.