The number 58978
58978 is a composite number with 8 divisors. Its prime factorisation is 2 × 37 × 797. Divisors (8): 1, 2, 37, 74, 797, 1594, 29489, 58978.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 58978: a Harshad number: divisible by its digit sum 37.
- 2
58978 is composite. Its prime factorisation is
- 3
The divisors add up to 90972; without 58978 itself that is 31994, so 58978 is deficient (31994 is less than 58978). Euler's totient φ(58978) = 28656 numbers up to 58978 share no factor with it.
- 4
The digits of 58978 add up to 37, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 58978 = 2 \times 37 \times 797 \]
58978 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 90972 |
| Euler totient φ(n) | 28656 |
| Square | 3478404484 |
| Cube | 205149339657352 |
| Square root | 242.853866 |
| Digit sum / digital root | 37 / 1 |
| Collatz steps to 1 | 47 |
| Scientific notation | 5.8978 × |
58978 in other forms
| Form | Value |
|---|---|
| In words | fifty-eight thousand nine hundred and seventy-eight |
| Binary (base 2) | 1110011001100010 |
| Octal (base 8) | 163142 |
| Hexadecimal (base 16) | E662 |
| Base 3 | 2222220101 |
| As time | 58978 seconds = 16 h 22 min 58 s |
Is 58978 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (58978 ÷ 2 = 29489) | 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 3) | 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 7) | 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 58978 a prime number?
No. 58978 = 2 × 37 × 797, so it is divisible by 2.
What are the factors of 58978?
1, 2, 37, 74, 797, 1594, 29489, 58978.
What is 58978 in binary?
1110011001100010 (hexadecimal E662, octal 163142).
What is the square root of 58978?
About 242.8539.
Is 58978 divisible by 3?
No. Its digits add up to 37, which is not a multiple of 3.
What is special about the number 58978?
58978 is a Harshad number: divisible by its digit sum 37.