The number 81565
81565 is a composite number with 8 divisors. Its prime factorisation is 5 × 11 × 1483. Divisors (8): 1, 5, 11, 55, 1483, 7415, 16313, 81565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
81565 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
81565 is composite. Its prime factorisation is
- 3
The divisors add up to 106848; without 81565 itself that is 25283, so 81565 is deficient (25283 is less than 81565). Euler's totient φ(81565) = 59280 numbers up to 81565 share no factor with it.
- 4
The digits of 81565 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 138 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81565 = 5 \times 11 \times 1483 \]
81565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 106848 |
| Euler totient φ(n) | 59280 |
| Square | 6652849225 |
| Cube | 542639647037125 |
| Square root | 285.595868 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 138 |
| Scientific notation | 8.1565 × |
81565 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand five hundred and sixty-five |
| Binary (base 2) | 10011111010011101 |
| Octal (base 8) | 237235 |
| Hexadecimal (base 16) | 13E9D |
| Base 3 | 11010212221 |
| As time | 81565 seconds = 22 h 39 min 25 s |
Is 81565 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 1) | 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 | Yes (81565 ÷ 5 = 16313) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (81565 ÷ 11 = 7415) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81565 a prime number?
No. 81565 = 5 × 11 × 1483, so it is divisible by 5.
What are the factors of 81565?
1, 5, 11, 55, 1483, 7415, 16313, 81565.
What is 81565 in binary?
10011111010011101 (hexadecimal 13E9D, octal 237235).
What is the square root of 81565?
About 285.5959.
Is 81565 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 81565?
It is a composite number with 8 divisors.