The number 39081
39081 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 1861. Divisors (8): 1, 3, 7, 21, 1861, 5583, 13027, 39081.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 39081: a Harshad number: divisible by its digit sum 21.
- 2
39081 is composite. Its prime factorisation is
- 3
The divisors add up to 59584; without 39081 itself that is 20503, so 39081 is deficient (20503 is less than 39081). Euler's totient φ(39081) = 22320 numbers up to 39081 share no factor with it.
- 4
The digits of 39081 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 168 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39081 = 3 \times 7 \times 1861 \]
39081 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 59584 |
| Euler totient φ(n) | 22320 |
| Square | 1527324561 |
| Cube | 59689371168441 |
| Square root | 197.689150 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 168 |
| Scientific notation | 3.9081 × |
39081 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand and eighty-one |
| Binary (base 2) | 1001100010101001 |
| Octal (base 8) | 114251 |
| Hexadecimal (base 16) | 98A9 |
| Base 3 | 1222121110 |
| As time | 39081 seconds = 10 h 51 min 21 s |
Is 39081 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 (39081 ÷ 3 = 13027) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 | Yes (39081 ÷ 7 = 5583) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 39081 a prime number?
No. 39081 = 3 × 7 × 1861, so it is divisible by 3.
What are the factors of 39081?
1, 3, 7, 21, 1861, 5583, 13027, 39081.
What is 39081 in binary?
1001100010101001 (hexadecimal 98A9, octal 114251).
What is the square root of 39081?
About 197.6891.
Is 39081 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 39081?
39081 is a Harshad number: divisible by its digit sum 21.