The number 39948
39948 is a composite number with 12 divisors. Its prime factorisation is × 3 × 3329. Divisors (12): 1, 2, 3, 4, 6, 12, 3329, 6658, 9987, 13316, 19974, 39948.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
39948 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
39948 is composite. Its prime factorisation is
- 3
The divisors add up to 93240; without 39948 itself that is 53292, so 39948 is abundant (53292 is more than 39948). Euler's totient φ(39948) = 13312 numbers up to 39948 share no factor with it.
- 4
The digits of 39948 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 168 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39948 = 2^{2} \times 3 \times 3329 \]39948 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 93240 |
| Euler totient φ(n) | 13312 |
| Square | 1595842704 |
| Cube | 63750724339392 |
| Square root | 199.869958 (= 2√9987) |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 168 |
| Scientific notation | 3.9948 × |
39948 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand nine hundred and forty-eight |
| Binary (base 2) | 1001110000001100 |
| Octal (base 8) | 116014 |
| Hexadecimal (base 16) | 9C0C |
| Base 3 | 2000210120 |
| As time | 39948 seconds = 11 h 5 min 48 s |
Is 39948 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (39948 ÷ 2 = 19974) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (39948 ÷ 3 = 13316) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (39948 ÷ 4 = 9987) | 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 (39948 ÷ 6 = 6658) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (39948 ÷ 12 = 3329) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 39948 a prime number?
No. 39948 = × 3 × 3329, so it is divisible by 2.
What are the factors of 39948?
1, 2, 3, 4, 6, 12, 3329, 6658, 9987, 13316, 19974, 39948.
What is 39948 in binary?
1001110000001100 (hexadecimal 9C0C, octal 116014).
What is the square root of 39948?
About 199.8700, exactly 2√9987.
Is 39948 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 39948?
It is a composite number with 12 divisors.