The number 81364
81364 is a composite number with 6 divisors. Its prime factorisation is × 20341. Divisors (6): 1, 2, 4, 20341, 40682, 81364.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
81364 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
81364 is composite. Its prime factorisation is
- 3
The divisors add up to 142394; without 81364 itself that is 61030, so 81364 is deficient (61030 is less than 81364). Euler's totient φ(81364) = 40680 numbers up to 81364 share no factor with it.
- 4
The digits of 81364 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 37 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81364 = 2^{2} \times 20341 \]81364 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 142394 |
| Euler totient φ(n) | 40680 |
| Square | 6620100496 |
| Cube | 538637856756544 |
| Square root | 285.243755 (= 2√20341) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 37 |
| Scientific notation | 8.1364 × |
81364 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand three hundred and sixty-four |
| Binary (base 2) | 10011110111010100 |
| Octal (base 8) | 236724 |
| Hexadecimal (base 16) | 13DD4 |
| Base 3 | 11010121111 |
| As time | 81364 seconds = 22 h 36 min 4 s |
Is 81364 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (81364 ÷ 2 = 40682) | 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 | Yes (81364 ÷ 4 = 20341) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 4) | 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 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81364 a prime number?
No. 81364 = × 20341, so it is divisible by 2.
What are the factors of 81364?
1, 2, 4, 20341, 40682, 81364.
What is 81364 in binary?
10011110111010100 (hexadecimal 13DD4, octal 236724).
What is the square root of 81364?
About 285.2438, exactly 2√20341.
Is 81364 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 81364?
It is a composite number with 6 divisors.