The number 48057
48057 is a composite number with 8 divisors. Its prime factorisation is 3 × 83 × 193. Divisors (8): 1, 3, 83, 193, 249, 579, 16019, 48057.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48057 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48057 is composite. Its prime factorisation is
- 3
The divisors add up to 65184; without 48057 itself that is 17127, so 48057 is deficient (17127 is less than 48057). Euler's totient φ(48057) = 31488 numbers up to 48057 share no factor with it.
- 4
The digits of 48057 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 44 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48057 = 3 \times 83 \times 193 \]
48057 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 65184 |
| Euler totient φ(n) | 31488 |
| Square | 2309475249 |
| Cube | 110986452041193 |
| Square root | 219.219069 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 44 |
| Scientific notation | 4.8057 × |
48057 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand and fifty-seven |
| Binary (base 2) | 1011101110111001 |
| Octal (base 8) | 135671 |
| Hexadecimal (base 16) | BBB9 |
| Base 3 | 2102220220 |
| As time | 48057 seconds = 13 h 20 min 57 s |
Is 48057 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 (48057 ÷ 3 = 16019) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48057 a prime number?
No. 48057 = 3 × 83 × 193, so it is divisible by 3.
What are the factors of 48057?
1, 3, 83, 193, 249, 579, 16019, 48057.
What is 48057 in binary?
1011101110111001 (hexadecimal BBB9, octal 135671).
What is the square root of 48057?
About 219.2191.
Is 48057 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 48057?
It is a composite number with 8 divisors.