The number 81505
81505 is a composite number with 4 divisors. Its prime factorisation is 5 × 16301. Divisors (4): 1, 5, 16301, 81505.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 81505: a semiprime: 5 × 16301, the product of two primes.
- 2
81505 is composite. Its prime factorisation is
- 3
The divisors add up to 97812; without 81505 itself that is 16307, so 81505 is deficient (16307 is less than 81505). Euler's totient φ(81505) = 65200 numbers up to 81505 share no factor with it.
- 4
The digits of 81505 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81505 = 5 \times 16301 \]
81505 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 97812 |
| Euler totient φ(n) | 65200 |
| Square | 6643065025 |
| Cube | 541443014862625 |
| Square root | 285.490805 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 89 |
| Scientific notation | 8.1505 × |
81505 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand five hundred and five |
| Binary (base 2) | 10011111001100001 |
| Octal (base 8) | 237141 |
| Hexadecimal (base 16) | 13E61 |
| Base 3 | 11010210201 |
| As time | 81505 seconds = 22 h 38 min 25 s |
Is 81505 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 (81505 ÷ 5 = 16301) | 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 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 1) | 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 6) | 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 81505 a prime number?
No. 81505 = 5 × 16301, so it is divisible by 5.
What are the factors of 81505?
1, 5, 16301, 81505.
What is 81505 in binary?
10011111001100001 (hexadecimal 13E61, octal 237141).
What is the square root of 81505?
About 285.4908.
Is 81505 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 81505?
81505 is a semiprime: 5 × 16301, the product of two primes.