The number 58048
58048 is a composite number with 14 divisors. Its prime factorisation is × 907. Divisors (14): 1, 2, 4, 8, 16, 32, 64, 907, 1814, 3628, 7256, 14512, 29024, 58048.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
58048 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
58048 is composite. Its prime factorisation is
- 3
The divisors add up to 115316; without 58048 itself that is 57268, so 58048 is deficient (57268 is less than 58048). Euler's totient φ(58048) = 28992 numbers up to 58048 share no factor with it.
- 4
The digits of 58048 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 58048 = 2^{6} \times 907 \]58048 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 14 |
| Sum of divisors | 115316 |
| Euler totient φ(n) | 28992 |
| Square | 3369570304 |
| Cube | 195596817006592 |
| Square root | 240.931526 (= 8√907) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.8048 × |
58048 in other forms
| Form | Value |
|---|---|
| In words | fifty-eight thousand and forty-eight |
| Binary (base 2) | 1110001011000000 |
| Octal (base 8) | 161300 |
| Hexadecimal (base 16) | E2C0 |
| Base 3 | 2221121221 |
| As time | 58048 seconds = 16 h 7 min 28 s |
Is 58048 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (58048 ÷ 2 = 29024) | 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 | Yes (58048 ÷ 4 = 14512) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 | Yes (58048 ÷ 8 = 7256) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 58048 a prime number?
No. 58048 = × 907, so it is divisible by 2.
What are the factors of 58048?
1, 2, 4, 8, 16, 32, 64, 907, 1814, 3628, 7256, 14512, 29024, 58048.
What is 58048 in binary?
1110001011000000 (hexadecimal E2C0, octal 161300).
What is the square root of 58048?
About 240.9315, exactly 8√907.
Is 58048 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 58048?
It is a composite number with 14 divisors.