The number 81561
81561 is a composite number with 8 divisors. Its prime factorisation is 3 × 31 × 877. Divisors (8): 1, 3, 31, 93, 877, 2631, 27187, 81561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
81561 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
81561 is composite. Its prime factorisation is
- 3
The divisors add up to 112384; without 81561 itself that is 30823, so 81561 is deficient (30823 is less than 81561). Euler's totient φ(81561) = 52560 numbers up to 81561 share no factor with it.
- 4
The digits of 81561 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 138 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81561 = 3 \times 31 \times 877 \]
81561 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 112384 |
| Euler totient φ(n) | 52560 |
| Square | 6652196721 |
| Cube | 542559816761481 |
| Square root | 285.588865 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 138 |
| Scientific notation | 8.1561 × |
81561 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand five hundred and sixty-one |
| Binary (base 2) | 10011111010011001 |
| Octal (base 8) | 237231 |
| Hexadecimal (base 16) | 13E99 |
| Base 3 | 11010212210 |
| As time | 81561 seconds = 22 h 39 min 21 s |
Is 81561 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 (81561 ÷ 3 = 27187) | 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 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 7) | 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 81561 a prime number?
No. 81561 = 3 × 31 × 877, so it is divisible by 3.
What are the factors of 81561?
1, 3, 31, 93, 877, 2631, 27187, 81561.
What is 81561 in binary?
10011111010011001 (hexadecimal 13E99, octal 237231).
What is the square root of 81561?
About 285.5889.
Is 81561 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 81561?
It is a composite number with 8 divisors.