The number 58052
58052 is a composite number with 12 divisors. Its prime factorisation is × 23 × 631. Divisors (12): 1, 2, 4, 23, 46, 92, 631, 1262, 2524, 14513, 29026, 58052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
58052 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
58052 is composite. Its prime factorisation is
- 3
The divisors add up to 106176; without 58052 itself that is 48124, so 58052 is deficient (48124 is less than 58052). Euler's totient φ(58052) = 27720 numbers up to 58052 share no factor with it.
- 4
The digits of 58052 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 58052 = 2^{2} \times 23 \times 631 \]58052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 106176 |
| Euler totient φ(n) | 27720 |
| Square | 3370034704 |
| Cube | 195637254636608 |
| Square root | 240.939827 (= 2√14513) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 73 |
| Scientific notation | 5.8052 × |
58052 in other forms
| Form | Value |
|---|---|
| In words | fifty-eight thousand and fifty-two |
| Binary (base 2) | 1110001011000100 |
| Octal (base 8) | 161304 |
| Hexadecimal (base 16) | E2C4 |
| Base 3 | 2221122002 |
| As time | 58052 seconds = 16 h 7 min 32 s |
Is 58052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (58052 ÷ 2 = 29026) | 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 | Yes (58052 ÷ 4 = 14513) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 58052 a prime number?
No. 58052 = × 23 × 631, so it is divisible by 2.
What are the factors of 58052?
1, 2, 4, 23, 46, 92, 631, 1262, 2524, 14513, 29026, 58052.
What is 58052 in binary?
1110001011000100 (hexadecimal E2C4, octal 161304).
What is the square root of 58052?
About 240.9398, exactly 2√14513.
Is 58052 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 58052?
It is a composite number with 12 divisors.