The number 81461
81461 is a composite number with 6 divisors. Its prime factorisation is 29 Ć . Divisors (6): 1, 29, 53, 1537, 2809, 81461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
81461 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
81461 is composite. Its prime factorisation is
- 3
The divisors add up to 85890; without 81461 itself that is 4429, so 81461 is deficient (4429 is less than 81461). Euler's totient Ļ(81461) = 77168 numbers up to 81461 share no factor with it.
- 4
The digits of 81461 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81461 = 29 \times 53^{2} \]81461 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 85890 |
| Euler totient Ļ(n) | 77168 |
| Square | 6635894521 |
| Cube | 540566603575181 |
| Square root | 285.413735 (= 53ā29) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 45 |
| Scientific notation | 8.1461 Ć |
81461 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand four hundred and sixty-one |
| Binary (base 2) | 10011111000110101 |
| Octal (base 8) | 237065 |
| Hexadecimal (base 16) | 13E35 |
| Base 3 | 11010202002 |
| As time | 81461 seconds = 22 h 37 min 41 s |
Is 81461 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 | No (remainder 2) | 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 5) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81461 a prime number?
No. 81461 = 29 Ć , so it is divisible by 29.
What are the factors of 81461?
1, 29, 53, 1537, 2809, 81461.
What is 81461 in binary?
10011111000110101 (hexadecimal 13E35, octal 237065).
What is the square root of 81461?
About 285.4137, exactly 53ā29.
Is 81461 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 81461?
It is a composite number with 6 divisors.