The number 81141
81141 is a composite number with 16 divisors. Its prime factorisation is 3 × 17 × 37 × 43. Divisors (16): 1, 3, 17, 37, 43, 51, 111, 129, 629, 731, 1591, 1887, 2193, 4773, 27047, 81141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
81141 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
81141 is composite. Its prime factorisation is
- 3
The divisors add up to 120384; without 81141 itself that is 39243, so 81141 is deficient (39243 is less than 81141). Euler's totient φ(81141) = 48384 numbers up to 81141 share no factor with it.
- 4
The digits of 81141 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81141 = 3 \times 17 \times 37 \times 43 \]
81141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 120384 |
| Euler totient φ(n) | 48384 |
| Square | 6583861881 |
| Cube | 534221136886221 |
| Square root | 284.852593 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 89 |
| Scientific notation | 8.1141 × |
81141 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand one hundred and forty-one |
| Binary (base 2) | 10011110011110101 |
| Octal (base 8) | 236365 |
| Hexadecimal (base 16) | 13CF5 |
| Base 3 | 11010022020 |
| As time | 81141 seconds = 22 h 32 min 21 s |
Is 81141 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 (81141 ÷ 3 = 27047) | 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 | No (remainder 6) | 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 5) | 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 81141 a prime number?
No. 81141 = 3 × 17 × 37 × 43, so it is divisible by 3.
What are the factors of 81141?
1, 3, 17, 37, 43, 51, 111, 129, 629, 731, 1591, 1887, 2193, 4773, 27047, 81141.
What is 81141 in binary?
10011110011110101 (hexadecimal 13CF5, octal 236365).
What is the square root of 81141?
About 284.8526.
Is 81141 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 81141?
It is a composite number with 16 divisors.