The number 39771
39771 is a composite number with 10 divisors. Its prime factorisation is × 491. Divisors (10): 1, 3, 9, 27, 81, 491, 1473, 4419, 13257, 39771.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 39771: a Harshad number: divisible by its digit sum 27.
- 2
39771 is composite. Its prime factorisation is
- 3
The divisors add up to 59532; without 39771 itself that is 19761, so 39771 is deficient (19761 is less than 39771). Euler's totient φ(39771) = 26460 numbers up to 39771 share no factor with it.
- 4
The digits of 39771 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 75 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39771 = 3^{4} \times 491 \]39771 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 59532 |
| Euler totient φ(n) | 26460 |
| Square | 1581732441 |
| Cube | 62907080911011 |
| Square root | 199.426678 (= 9√491) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 75 |
| Scientific notation | 3.9771 × |
39771 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand seven hundred and seventy-one |
| Binary (base 2) | 1001101101011011 |
| Octal (base 8) | 115533 |
| Hexadecimal (base 16) | 9B5B |
| Base 3 | 2000120000 |
| As time | 39771 seconds = 11 h 2 min 51 s |
Is 39771 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 (39771 ÷ 3 = 13257) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (39771 ÷ 9 = 4419) | 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 6) | 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 39771 a prime number?
No. 39771 = × 491, so it is divisible by 3.
What are the factors of 39771?
1, 3, 9, 27, 81, 491, 1473, 4419, 13257, 39771.
What is 39771 in binary?
1001101101011011 (hexadecimal 9B5B, octal 115533).
What is the square root of 39771?
About 199.4267, exactly 9√491.
Is 39771 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 39771?
39771 is a Harshad number: divisible by its digit sum 27.