The number 81302
81302 is a composite number with 16 divisors. Its prime factorisation is 2 × 13 × 53 × 59. Divisors (16): 1, 2, 13, 26, 53, 59, 106, 118, 689, 767, 1378, 1534, 3127, 6254, 40651, 81302.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
81302 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
81302 is composite. Its prime factorisation is
- 3
The divisors add up to 136080; without 81302 itself that is 54778, so 81302 is deficient (54778 is less than 81302). Euler's totient φ(81302) = 36192 numbers up to 81302 share no factor with it.
- 4
The digits of 81302 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 138 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81302 = 2 \times 13 \times 53 \times 59 \]
81302 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 136080 |
| Euler totient φ(n) | 36192 |
| Square | 6610015204 |
| Cube | 537407456115608 |
| Square root | 285.135056 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 138 |
| Scientific notation | 8.1302 × |
81302 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand three hundred and two |
| Binary (base 2) | 10011110110010110 |
| Octal (base 8) | 236626 |
| Hexadecimal (base 16) | 13D96 |
| Base 3 | 11010112012 |
| As time | 81302 seconds = 22 h 35 min 2 s |
Is 81302 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (81302 ÷ 2 = 40651) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81302 a prime number?
No. 81302 = 2 × 13 × 53 × 59, so it is divisible by 2.
What are the factors of 81302?
1, 2, 13, 26, 53, 59, 106, 118, 689, 767, 1378, 1534, 3127, 6254, 40651, 81302.
What is 81302 in binary?
10011110110010110 (hexadecimal 13D96, octal 236626).
What is the square root of 81302?
About 285.1351.
Is 81302 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 81302?
It is a composite number with 16 divisors.