The number 58051
58051 is a composite number with 4 divisors. Its prime factorisation is 7 × 8293. Divisors (4): 1, 7, 8293, 58051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 58051: a semiprime: 7 × 8293, the product of two primes.
- 2
58051 is composite. Its prime factorisation is
- 3
The divisors add up to 66352; without 58051 itself that is 8301, so 58051 is deficient (8301 is less than 58051). Euler's totient φ(58051) = 49752 numbers up to 58051 share no factor with it.
- 4
The digits of 58051 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 197 steps to reach 1.
LaTeX source of the formulas on this page
\[ 58051 = 7 \times 8293 \]
58051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 66352 |
| Euler totient φ(n) | 49752 |
| Square | 3369918601 |
| Cube | 195627144706651 |
| Square root | 240.937751 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 197 |
| Scientific notation | 5.8051 × |
58051 in other forms
| Form | Value |
|---|---|
| In words | fifty-eight thousand and fifty-one |
| Binary (base 2) | 1110001011000011 |
| Octal (base 8) | 161303 |
| Hexadecimal (base 16) | E2C3 |
| Base 3 | 2221122001 |
| As time | 58051 seconds = 16 h 7 min 31 s |
Is 58051 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 | No (remainder 1) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (58051 ÷ 7 = 8293) | 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 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 58051 a prime number?
No. 58051 = 7 × 8293, so it is divisible by 7.
What are the factors of 58051?
1, 7, 8293, 58051.
What is 58051 in binary?
1110001011000011 (hexadecimal E2C3, octal 161303).
What is the square root of 58051?
About 240.9378.
Is 58051 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 58051?
58051 is a semiprime: 7 × 8293, the product of two primes.