The number 58053
58053 is a composite number with 8 divisors. Its prime factorisation is 3 × 37 × 523. Divisors (8): 1, 3, 37, 111, 523, 1569, 19351, 58053.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
58053 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
58053 is composite. Its prime factorisation is
- 3
The divisors add up to 79648; without 58053 itself that is 21595, so 58053 is deficient (21595 is less than 58053). Euler's totient φ(58053) = 37584 numbers up to 58053 share no factor with it.
- 4
The digits of 58053 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 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 58053 = 3 \times 37 \times 523 \]
58053 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 79648 |
| Euler totient φ(n) | 37584 |
| Square | 3370150809 |
| Cube | 195647364914877 |
| Square root | 240.941902 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 73 |
| Scientific notation | 5.8053 × |
58053 in other forms
| Form | Value |
|---|---|
| In words | fifty-eight thousand and fifty-three |
| Binary (base 2) | 1110001011000101 |
| Octal (base 8) | 161305 |
| Hexadecimal (base 16) | E2C5 |
| Base 3 | 2221122010 |
| As time | 58053 seconds = 16 h 7 min 33 s |
Is 58053 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 (58053 ÷ 3 = 19351) | 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 3) | 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 5) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 58053 a prime number?
No. 58053 = 3 × 37 × 523, so it is divisible by 3.
What are the factors of 58053?
1, 3, 37, 111, 523, 1569, 19351, 58053.
What is 58053 in binary?
1110001011000101 (hexadecimal E2C5, octal 161305).
What is the square root of 58053?
About 240.9419.
Is 58053 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 58053?
It is a composite number with 8 divisors.