The number 81330
81330 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 2711. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 2711, 5422, 8133, 13555, 16266, 27110, 40665, 81330.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 81330: a Harshad number: divisible by its digit sum 15.
- 2
81330 is composite. Its prime factorisation is
- 3
The divisors add up to 195264; without 81330 itself that is 113934, so 81330 is abundant (113934 is more than 81330). Euler's totient φ(81330) = 21680 numbers up to 81330 share no factor with it.
- 4
The digits of 81330 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81330 = 2 \times 3 \times 5 \times 2711 \]
81330 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 195264 |
| Euler totient φ(n) | 21680 |
| Square | 6614568900 |
| Cube | 537962888637000 |
| Square root | 285.184151 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 89 |
| Scientific notation | 8.133 × |
81330 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand three hundred and thirty |
| Binary (base 2) | 10011110110110010 |
| Octal (base 8) | 236662 |
| Hexadecimal (base 16) | 13DB2 |
| Base 3 | 11010120020 |
| As time | 81330 seconds = 22 h 35 min 30 s |
Is 81330 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (81330 ÷ 2 = 40665) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (81330 ÷ 3 = 27110) | 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 | Yes (81330 ÷ 5 = 16266) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (81330 ÷ 6 = 13555) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (81330 ÷ 10 = 8133) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81330 a prime number?
No. 81330 = 2 × 3 × 5 × 2711, so it is divisible by 2.
What are the factors of 81330?
1, 2, 3, 5, 6, 10, 15, 30, 2711, 5422, 8133, 13555, 16266, 27110, 40665, 81330.
What is 81330 in binary?
10011110110110010 (hexadecimal 13DB2, octal 236662).
What is the square root of 81330?
About 285.1842.
Is 81330 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 81330?
81330 is a Harshad number: divisible by its digit sum 15.