The number 53058
53058 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 37 × 239. Divisors (16): 1, 2, 3, 6, 37, 74, 111, 222, 239, 478, 717, 1434, 8843, 17686, 26529, 53058.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53058 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53058 is composite. Its prime factorisation is
- 3
The divisors add up to 109440; without 53058 itself that is 56382, so 53058 is abundant (56382 is more than 53058). Euler's totient φ(53058) = 17136 numbers up to 53058 share no factor with it.
- 4
The digits of 53058 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53058 = 2 \times 3 \times 37 \times 239 \]
53058 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 109440 |
| Euler totient φ(n) | 17136 |
| Square | 2815151364 |
| Cube | 149366301071112 |
| Square root | 230.343222 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.3058 × |
53058 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand and fifty-eight |
| Binary (base 2) | 1100111101000010 |
| Octal (base 8) | 147502 |
| Hexadecimal (base 16) | CF42 |
| Base 3 | 2200210010 |
| As time | 53058 seconds = 14 h 44 min 18 s |
Is 53058 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53058 ÷ 2 = 26529) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (53058 ÷ 3 = 17686) | 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 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (53058 ÷ 6 = 8843) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 3) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53058 a prime number?
No. 53058 = 2 × 3 × 37 × 239, so it is divisible by 2.
What are the factors of 53058?
1, 2, 3, 6, 37, 74, 111, 222, 239, 478, 717, 1434, 8843, 17686, 26529, 53058.
What is 53058 in binary?
1100111101000010 (hexadecimal CF42, octal 147502).
What is the square root of 53058?
About 230.3432.
Is 53058 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 53058?
It is a composite number with 16 divisors.