The number 58059
58059 is a composite number with 6 divisors. Its prime factorisation is × 6451. Divisors (6): 1, 3, 9, 6451, 19353, 58059.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
58059 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
58059 is composite. Its prime factorisation is
- 3
The divisors add up to 83876; without 58059 itself that is 25817, so 58059 is deficient (25817 is less than 58059). Euler's totient φ(58059) = 38700 numbers up to 58059 share no factor with it.
- 4
The digits of 58059 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 197 steps to reach 1.
LaTeX source of the formulas on this page
\[ 58059 = 3^{2} \times 6451 \]58059 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 83876 |
| Euler totient φ(n) | 38700 |
| Square | 3370847481 |
| Cube | 195708033899379 |
| Square root | 240.954353 (= 3√6451) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 197 |
| Scientific notation | 5.8059 × |
58059 in other forms
| Form | Value |
|---|---|
| In words | fifty-eight thousand and fifty-nine |
| Binary (base 2) | 1110001011001011 |
| Octal (base 8) | 161313 |
| Hexadecimal (base 16) | E2CB |
| Base 3 | 2221122100 |
| As time | 58059 seconds = 16 h 7 min 39 s |
Is 58059 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 (58059 ÷ 3 = 19353) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (58059 ÷ 9 = 6451) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 58059 a prime number?
No. 58059 = × 6451, so it is divisible by 3.
What are the factors of 58059?
1, 3, 9, 6451, 19353, 58059.
What is 58059 in binary?
1110001011001011 (hexadecimal E2CB, octal 161313).
What is the square root of 58059?
About 240.9544, exactly 3√6451.
Is 58059 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 58059?
It is a composite number with 6 divisors.