The number 39932
39932 is a composite number with 12 divisors. Its prime factorisation is × 67 × 149. Divisors (12): 1, 2, 4, 67, 134, 149, 268, 298, 596, 9983, 19966, 39932.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
39932 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
39932 is composite. Its prime factorisation is
- 3
The divisors add up to 71400; without 39932 itself that is 31468, so 39932 is deficient (31468 is less than 39932). Euler's totient φ(39932) = 19536 numbers up to 39932 share no factor with it.
- 4
The digits of 39932 add up to 26, 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
\[ 39932 = 2^{2} \times 67 \times 149 \]39932 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 71400 |
| Euler totient φ(n) | 19536 |
| Square | 1594564624 |
| Cube | 63674154565568 |
| Square root | 199.829928 (= 2√9983) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 168 |
| Scientific notation | 3.9932 × |
39932 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand nine hundred and thirty-two |
| Binary (base 2) | 1001101111111100 |
| Octal (base 8) | 115774 |
| Hexadecimal (base 16) | 9BFC |
| Base 3 | 2000202222 |
| As time | 39932 seconds = 11 h 5 min 32 s |
Is 39932 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (39932 ÷ 2 = 19966) | 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 (39932 ÷ 4 = 9983) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 4) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 39932 a prime number?
No. 39932 = × 67 × 149, so it is divisible by 2.
What are the factors of 39932?
1, 2, 4, 67, 134, 149, 268, 298, 596, 9983, 19966, 39932.
What is 39932 in binary?
1001101111111100 (hexadecimal 9BFC, octal 115774).
What is the square root of 39932?
About 199.8299, exactly 2√9983.
Is 39932 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 39932?
It is a composite number with 12 divisors.