The number 81481
81481 is a composite number with 4 divisors. Its prime factorisation is 17 × 4793. Divisors (4): 1, 17, 4793, 81481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 81481: a semiprime: 17 × 4793, the product of two primes.
- 2
81481 is composite. Its prime factorisation is
- 3
The divisors add up to 86292; without 81481 itself that is 4811, so 81481 is deficient (4811 is less than 81481). Euler's totient φ(81481) = 76672 numbers up to 81481 share no factor with it.
- 4
The digits of 81481 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 138 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81481 = 17 \times 4793 \]
81481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 86292 |
| Euler totient φ(n) | 76672 |
| Square | 6639153361 |
| Cube | 540964855007641 |
| Square root | 285.448769 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 138 |
| Scientific notation | 8.1481 × |
81481 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand four hundred and eighty-one |
| Binary (base 2) | 10011111001001001 |
| Octal (base 8) | 237111 |
| Hexadecimal (base 16) | 13E49 |
| Base 3 | 11010202211 |
| As time | 81481 seconds = 22 h 38 min 1 s |
Is 81481 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 | No (remainder 1) | 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 1) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 81481 a prime number?
No. 81481 = 17 × 4793, so it is divisible by 17.
What are the factors of 81481?
1, 17, 4793, 81481.
What is 81481 in binary?
10011111001001001 (hexadecimal 13E49, octal 237111).
What is the square root of 81481?
About 285.4488.
Is 81481 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 81481?
81481 is a semiprime: 17 × 4793, the product of two primes.