The number 39958
39958 is a composite number with 4 divisors. Its prime factorisation is 2 × 19979. Divisors (4): 1, 2, 19979, 39958.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 39958: a semiprime: 2 × 19979, the product of two primes.
- 2
39958 is composite. Its prime factorisation is
- 3
The divisors add up to 59940; without 39958 itself that is 19982, so 39958 is deficient (19982 is less than 39958). Euler's totient φ(39958) = 19978 numbers up to 39958 share no factor with it.
- 4
The digits of 39958 add up to 34, 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
\[ 39958 = 2 \times 19979 \]
39958 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 59940 |
| Euler totient φ(n) | 19978 |
| Square | 1596641764 |
| Cube | 63798611605912 |
| Square root | 199.894972 |
| Digit sum / digital root | 34 / 7 |
| Collatz steps to 1 | 168 |
| Scientific notation | 3.9958 × |
39958 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand nine hundred and fifty-eight |
| Binary (base 2) | 1001110000010110 |
| Octal (base 8) | 116026 |
| Hexadecimal (base 16) | 9C16 |
| Base 3 | 2000210221 |
| As time | 39958 seconds = 11 h 5 min 58 s |
Is 39958 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (39958 ÷ 2 = 19979) | 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 6) | 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 6) | 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 39958 a prime number?
No. 39958 = 2 × 19979, so it is divisible by 2.
What are the factors of 39958?
1, 2, 19979, 39958.
What is 39958 in binary?
1001110000010110 (hexadecimal 9C16, octal 116026).
What is the square root of 39958?
About 199.8950.
Is 39958 divisible by 3?
No. Its digits add up to 34, which is not a multiple of 3.
What is special about the number 39958?
39958 is a semiprime: 2 × 19979, the product of two primes.