The number 58
58 is a composite number with 4 divisors. Its prime factorisation is 2 × 29. Divisors (4): 1, 2, 29, 58.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 58: a semiprime: 2 × 29, the product of two primes.
- 2
58 is composite. Its prime factorisation is
- 3
The divisors add up to 90; without 58 itself that is 32, so 58 is deficient (32 is less than 58). Euler's totient φ(58) = 28 numbers up to 58 share no factor with it.
- 4
The digits of 58 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 19 steps to reach 1.
LaTeX source of the formulas on this page
\[ 58 = 2 \times 29 \]
58 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 90 |
| Euler totient φ(n) | 28 |
| Square | 3364 |
| Cube | 195112 |
| Square root | 7.615773 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 19 |
| Scientific notation | 5.8 × |
58 in other forms
| Form | Value |
|---|---|
| In words | fifty-eight |
| Roman numerals | LVIII |
| Binary (base 2) | 111010 |
| Octal (base 8) | 72 |
| Hexadecimal (base 16) | 3A |
| Base 3 | 2011 |
| As time | 58 seconds |
Is 58 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (58 ÷ 2 = 29) | 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 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 3) | 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 58 a prime number?
No. 58 = 2 × 29, so it is divisible by 2.
What are the factors of 58?
1, 2, 29, 58.
What is 58 in binary?
111010 (hexadecimal 3A, octal 72).
What is the square root of 58?
About 7.6158.
What is 58 in Roman numerals?
LVIII.
Is 58 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 58?
58 is a semiprime: 2 × 29, the product of two primes.