The number 58258
58258 is a composite number with 4 divisors. Its prime factorisation is 2 × 29129. Divisors (4): 1, 2, 29129, 58258.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 58258: a semiprime: 2 × 29129, the product of two primes.
- 2
58258 is composite. Its prime factorisation is
- 3
The divisors add up to 87390; without 58258 itself that is 29132, so 58258 is deficient (29132 is less than 58258). Euler's totient φ(58258) = 29128 numbers up to 58258 share no factor with it.
- 4
The digits of 58258 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 58258 = 2 \times 29129 \]
58258 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 87390 |
| Euler totient φ(n) | 29128 |
| Square | 3393994564 |
| Cube | 197727335309512 |
| Square root | 241.366941 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.8258 × |
58258 in other forms
| Form | Value |
|---|---|
| In words | fifty-eight thousand two hundred and fifty-eight |
| Binary (base 2) | 1110001110010010 |
| Octal (base 8) | 161622 |
| Hexadecimal (base 16) | E392 |
| Base 3 | 2221220201 |
| As time | 58258 seconds = 16 h 10 min 58 s |
Is 58258 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (58258 ÷ 2 = 29129) | 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 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 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 1) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 58258 a prime number?
No. 58258 = 2 × 29129, so it is divisible by 2.
What are the factors of 58258?
1, 2, 29129, 58258.
What is 58258 in binary?
1110001110010010 (hexadecimal E392, octal 161622).
What is the square root of 58258?
About 241.3669.
Is 58258 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 58258?
58258 is a semiprime: 2 × 29129, the product of two primes.