The number 81535
81535 is a composite number with 8 divisors. Its prime factorisation is 5 × 23 × 709. Divisors (8): 1, 5, 23, 115, 709, 3545, 16307, 81535.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
81535 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
81535 is composite. Its prime factorisation is
- 3
The divisors add up to 102240; without 81535 itself that is 20705, so 81535 is deficient (20705 is less than 81535). Euler's totient φ(81535) = 62304 numbers up to 81535 share no factor with it.
- 4
The digits of 81535 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81535 = 5 \times 23 \times 709 \]
81535 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 102240 |
| Euler totient φ(n) | 62304 |
| Square | 6647956225 |
| Cube | 542041110805375 |
| Square root | 285.543342 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 151 |
| Scientific notation | 8.1535 × |
81535 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand five hundred and thirty-five |
| Binary (base 2) | 10011111001111111 |
| Octal (base 8) | 237177 |
| Hexadecimal (base 16) | 13E7F |
| Base 3 | 11010211211 |
| As time | 81535 seconds = 22 h 38 min 55 s |
Is 81535 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (81535 ÷ 5 = 16307) | 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 6) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81535 a prime number?
No. 81535 = 5 × 23 × 709, so it is divisible by 5.
What are the factors of 81535?
1, 5, 23, 115, 709, 3545, 16307, 81535.
What is 81535 in binary?
10011111001111111 (hexadecimal 13E7F, octal 237177).
What is the square root of 81535?
About 285.5433.
Is 81535 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 81535?
It is a composite number with 8 divisors.