The number 39058
39058 is a composite number with 8 divisors. Its prime factorisation is 2 × 59 × 331. Divisors (8): 1, 2, 59, 118, 331, 662, 19529, 39058.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
39058 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
39058 is composite. Its prime factorisation is
- 3
The divisors add up to 59760; without 39058 itself that is 20702, so 39058 is deficient (20702 is less than 39058). Euler's totient φ(39058) = 19140 numbers up to 39058 share no factor with it.
- 4
The digits of 39058 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 168 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39058 = 2 \times 59 \times 331 \]
39058 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 59760 |
| Euler totient φ(n) | 19140 |
| Square | 1525527364 |
| Cube | 59584047783112 |
| Square root | 197.630969 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 168 |
| Scientific notation | 3.9058 × |
39058 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand and fifty-eight |
| Binary (base 2) | 1001100010010010 |
| Octal (base 8) | 114222 |
| Hexadecimal (base 16) | 9892 |
| Base 3 | 1222120121 |
| As time | 39058 seconds = 10 h 50 min 58 s |
Is 39058 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (39058 ÷ 2 = 19529) | 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 5) | 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 7) | 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 8) | 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 39058 a prime number?
No. 39058 = 2 × 59 × 331, so it is divisible by 2.
What are the factors of 39058?
1, 2, 59, 118, 331, 662, 19529, 39058.
What is 39058 in binary?
1001100010010010 (hexadecimal 9892, octal 114222).
What is the square root of 39058?
About 197.6310.
Is 39058 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 39058?
It is a composite number with 8 divisors.