The number 39978
39978 is a composite number with 12 divisors. Its prime factorisation is 2 × × 2221. Divisors (12): 1, 2, 3, 6, 9, 18, 2221, 4442, 6663, 13326, 19989, 39978.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
39978 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
39978 is composite. Its prime factorisation is
- 3
The divisors add up to 86658; without 39978 itself that is 46680, so 39978 is abundant (46680 is more than 39978). Euler's totient φ(39978) = 13320 numbers up to 39978 share no factor with it.
- 4
The digits of 39978 add up to 36, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 181 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39978 = 2 \times 3^{2} \times 2221 \]39978 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 86658 |
| Euler totient φ(n) | 13320 |
| Square | 1598240484 |
| Cube | 63894458069352 |
| Square root | 199.944992 (= 3√4442) |
| Digit sum / digital root | 36 / 9 |
| Collatz steps to 1 | 181 |
| Scientific notation | 3.9978 × |
39978 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand nine hundred and seventy-eight |
| Binary (base 2) | 1001110000101010 |
| Octal (base 8) | 116052 |
| Hexadecimal (base 16) | 9C2A |
| Base 3 | 2000211200 |
| As time | 39978 seconds = 11 h 6 min 18 s |
Is 39978 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (39978 ÷ 2 = 19989) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (39978 ÷ 3 = 13326) | 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 | Yes (39978 ÷ 6 = 6663) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 | Yes (39978 ÷ 9 = 4442) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 39978 a prime number?
No. 39978 = 2 × × 2221, so it is divisible by 2.
What are the factors of 39978?
1, 2, 3, 6, 9, 18, 2221, 4442, 6663, 13326, 19989, 39978.
What is 39978 in binary?
1001110000101010 (hexadecimal 9C2A, octal 116052).
What is the square root of 39978?
About 199.9450, exactly 3√4442.
Is 39978 divisible by 3?
Yes. Its digits add up to 36, a multiple of 3.
What is special about the number 39978?
It is a composite number with 12 divisors.