The number 81068
81068 is a composite number with 12 divisors. Its prime factorisation is × 13 × 1559. Divisors (12): 1, 2, 4, 13, 26, 52, 1559, 3118, 6236, 20267, 40534, 81068.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
81068 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
81068 is composite. Its prime factorisation is
- 3
The divisors add up to 152880; without 81068 itself that is 71812, so 81068 is deficient (71812 is less than 81068). Euler's totient φ(81068) = 37392 numbers up to 81068 share no factor with it.
- 4
The digits of 81068 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81068 = 2^{2} \times 13 \times 1559 \]81068 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 152880 |
| Euler totient φ(n) | 37392 |
| Square | 6572020624 |
| Cube | 532780567946432 |
| Square root | 284.724428 (= 2√20267) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 76 |
| Scientific notation | 8.1068 × |
81068 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand and sixty-eight |
| Binary (base 2) | 10011110010101100 |
| Octal (base 8) | 236254 |
| Hexadecimal (base 16) | 13CAC |
| Base 3 | 11010012112 |
| As time | 81068 seconds = 22 h 31 min 8 s |
Is 81068 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (81068 ÷ 2 = 40534) | 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 | Yes (81068 ÷ 4 = 20267) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 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 4) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81068 a prime number?
No. 81068 = × 13 × 1559, so it is divisible by 2.
What are the factors of 81068?
1, 2, 4, 13, 26, 52, 1559, 3118, 6236, 20267, 40534, 81068.
What is 81068 in binary?
10011110010101100 (hexadecimal 13CAC, octal 236254).
What is the square root of 81068?
About 284.7244, exactly 2√20267.
Is 81068 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 81068?
It is a composite number with 12 divisors.