The number 39968
39968 is a composite number with 12 divisors. Its prime factorisation is × 1249. Divisors (12): 1, 2, 4, 8, 16, 32, 1249, 2498, 4996, 9992, 19984, 39968.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
39968 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
39968 is composite. Its prime factorisation is
- 3
The divisors add up to 78750; without 39968 itself that is 38782, so 39968 is deficient (38782 is less than 39968). Euler's totient φ(39968) = 19968 numbers up to 39968 share no factor with it.
- 4
The digits of 39968 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 181 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39968 = 2^{5} \times 1249 \]39968 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 78750 |
| Euler totient φ(n) | 19968 |
| Square | 1597441024 |
| Cube | 63846522847232 |
| Square root | 199.919984 (= 4√2498) |
| Digit sum / digital root | 35 / 8 |
| Collatz steps to 1 | 181 |
| Scientific notation | 3.9968 × |
39968 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand nine hundred and sixty-eight |
| Binary (base 2) | 1001110000100000 |
| Octal (base 8) | 116040 |
| Hexadecimal (base 16) | 9C20 |
| Base 3 | 2000211022 |
| As time | 39968 seconds = 11 h 6 min 8 s |
Is 39968 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (39968 ÷ 2 = 19984) | 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 | Yes (39968 ÷ 4 = 9992) | 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 2) | 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 | Yes (39968 ÷ 8 = 4996) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 39968 a prime number?
No. 39968 = × 1249, so it is divisible by 2.
What are the factors of 39968?
1, 2, 4, 8, 16, 32, 1249, 2498, 4996, 9992, 19984, 39968.
What is 39968 in binary?
1001110000100000 (hexadecimal 9C20, octal 116040).
What is the square root of 39968?
About 199.9200, exactly 4√2498.
Is 39968 divisible by 3?
No. Its digits add up to 35, which is not a multiple of 3.
What is special about the number 39968?
It is a composite number with 12 divisors.