The number 39951
39951 is a composite number with 12 divisors. Its prime factorisation is × 23 × 193. Divisors (12): 1, 3, 9, 23, 69, 193, 207, 579, 1737, 4439, 13317, 39951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
39951 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
39951 is composite. Its prime factorisation is
- 3
The divisors add up to 60528; without 39951 itself that is 20577, so 39951 is deficient (20577 is less than 39951). Euler's totient φ(39951) = 25344 numbers up to 39951 share no factor with it.
- 4
The digits of 39951 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 168 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39951 = 3^{2} \times 23 \times 193 \]39951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 60528 |
| Euler totient φ(n) | 25344 |
| Square | 1596082401 |
| Cube | 63765088002351 |
| Square root | 199.877462 (= 3√4439) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 168 |
| Scientific notation | 3.9951 × |
39951 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand nine hundred and fifty-one |
| Binary (base 2) | 1001110000001111 |
| Octal (base 8) | 116017 |
| Hexadecimal (base 16) | 9C0F |
| Base 3 | 2000210200 |
| As time | 39951 seconds = 11 h 5 min 51 s |
Is 39951 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 | Yes (39951 ÷ 3 = 13317) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 | Yes (39951 ÷ 9 = 4439) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 39951 a prime number?
No. 39951 = × 23 × 193, so it is divisible by 3.
What are the factors of 39951?
1, 3, 9, 23, 69, 193, 207, 579, 1737, 4439, 13317, 39951.
What is 39951 in binary?
1001110000001111 (hexadecimal 9C0F, octal 116017).
What is the square root of 39951?
About 199.8775, exactly 3√4439.
Is 39951 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 39951?
It is a composite number with 12 divisors.