The number 58078
58078 is a composite number with 8 divisors. Its prime factorisation is 2 × 71 × 409. Divisors (8): 1, 2, 71, 142, 409, 818, 29039, 58078.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
58078 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
58078 is composite. Its prime factorisation is
- 3
The divisors add up to 88560; without 58078 itself that is 30482, so 58078 is deficient (30482 is less than 58078). Euler's totient φ(58078) = 28560 numbers up to 58078 share no factor with it.
- 4
The digits of 58078 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 166 steps to reach 1.
LaTeX source of the formulas on this page
\[ 58078 = 2 \times 71 \times 409 \]
58078 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 88560 |
| Euler totient φ(n) | 28560 |
| Square | 3373054084 |
| Cube | 195900235090552 |
| Square root | 240.993776 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 166 |
| Scientific notation | 5.8078 × |
58078 in other forms
| Form | Value |
|---|---|
| In words | fifty-eight thousand and seventy-eight |
| Binary (base 2) | 1110001011011110 |
| Octal (base 8) | 161336 |
| Hexadecimal (base 16) | E2DE |
| Base 3 | 2221200001 |
| As time | 58078 seconds = 16 h 7 min 58 s |
Is 58078 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (58078 ÷ 2 = 29039) | 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 6) | 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 6) | 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 9) | 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 58078 a prime number?
No. 58078 = 2 × 71 × 409, so it is divisible by 2.
What are the factors of 58078?
1, 2, 71, 142, 409, 818, 29039, 58078.
What is 58078 in binary?
1110001011011110 (hexadecimal E2DE, octal 161336).
What is the square root of 58078?
About 240.9938.
Is 58078 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 58078?
It is a composite number with 8 divisors.