The number 39959
39959 is a composite number with 4 divisors. Its prime factorisation is 31 × 1289. Divisors (4): 1, 31, 1289, 39959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 39959: a semiprime: 31 × 1289, the product of two primes.
- 2
39959 is composite. Its prime factorisation is
- 3
The divisors add up to 41280; without 39959 itself that is 1321, so 39959 is deficient (1321 is less than 39959). Euler's totient φ(39959) = 38640 numbers up to 39959 share no factor with it.
- 4
The digits of 39959 add up to 35, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 168 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39959 = 31 \times 1289 \]
39959 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 41280 |
| Euler totient φ(n) | 38640 |
| Square | 1596721681 |
| Cube | 63803401651079 |
| Square root | 199.897474 |
| Digit sum / digital root | 35 / 8 |
| Collatz steps to 1 | 168 |
| Scientific notation | 3.9959 × |
39959 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand nine hundred and fifty-nine |
| Binary (base 2) | 1001110000010111 |
| Octal (base 8) | 116027 |
| Hexadecimal (base 16) | 9C17 |
| Base 3 | 2000210222 |
| As time | 39959 seconds = 11 h 5 min 59 s |
Is 39959 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 39959 a prime number?
No. 39959 = 31 × 1289, so it is divisible by 31.
What are the factors of 39959?
1, 31, 1289, 39959.
What is 39959 in binary?
1001110000010111 (hexadecimal 9C17, octal 116027).
What is the square root of 39959?
About 199.8975.
Is 39959 divisible by 3?
No. Its digits add up to 35, which is not a multiple of 3.
What is special about the number 39959?
39959 is a semiprime: 31 × 1289, the product of two primes.