The number 39141
39141 is a composite number with 6 divisors. Its prime factorisation is × 4349. Divisors (6): 1, 3, 9, 4349, 13047, 39141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
39141 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
39141 is composite. Its prime factorisation is
- 3
The divisors add up to 56550; without 39141 itself that is 17409, so 39141 is deficient (17409 is less than 39141). Euler's totient φ(39141) = 26088 numbers up to 39141 share no factor with it.
- 4
The digits of 39141 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 199 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39141 = 3^{2} \times 4349 \]39141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 56550 |
| Euler totient φ(n) | 26088 |
| Square | 1532017881 |
| Cube | 59964711880221 |
| Square root | 197.840845 (= 3√4349) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 199 |
| Scientific notation | 3.9141 × |
39141 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand one hundred and forty-one |
| Binary (base 2) | 1001100011100101 |
| Octal (base 8) | 114345 |
| Hexadecimal (base 16) | 98E5 |
| Base 3 | 1222200200 |
| As time | 39141 seconds = 10 h 52 min 21 s |
Is 39141 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 (39141 ÷ 3 = 13047) | 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 | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (39141 ÷ 9 = 4349) | 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 3) | 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 39141 a prime number?
No. 39141 = × 4349, so it is divisible by 3.
What are the factors of 39141?
1, 3, 9, 4349, 13047, 39141.
What is 39141 in binary?
1001100011100101 (hexadecimal 98E5, octal 114345).
What is the square root of 39141?
About 197.8408, exactly 3√4349.
Is 39141 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 39141?
It is a composite number with 6 divisors.