The number 83064
83064 is a composite number with 16 divisors. Its prime factorisation is × 3 × 3461. Divisors (16): 1, 2, 3, 4, 6, 8, 12, 24, 3461, 6922, 10383, 13844, 20766, 27688, 41532, 83064.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
83064 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
83064 is composite. Its prime factorisation is
- 3
The divisors add up to 207720; without 83064 itself that is 124656, so 83064 is abundant (124656 is more than 83064). Euler's totient φ(83064) = 27680 numbers up to 83064 share no factor with it.
- 4
The digits of 83064 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 83064 = 2^{3} \times 3 \times 3461 \]83064 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 207720 |
| Euler totient φ(n) | 27680 |
| Square | 6899628096 |
| Cube | 573110708166144 |
| Square root | 288.208258 (= 2√20766) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 76 |
| Scientific notation | 8.3064 × |
83064 in other forms
| Form | Value |
|---|---|
| In words | eighty-three thousand and sixty-four |
| Binary (base 2) | 10100010001111000 |
| Octal (base 8) | 242170 |
| Hexadecimal (base 16) | 14478 |
| Base 3 | 11012221110 |
| As time | 83064 seconds = 23 h 4 min 24 s |
Is 83064 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (83064 ÷ 2 = 41532) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (83064 ÷ 3 = 27688) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (83064 ÷ 4 = 20766) | 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 | Yes (83064 ÷ 6 = 13844) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 | Yes (83064 ÷ 8 = 10383) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (83064 ÷ 12 = 6922) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 83064 a prime number?
No. 83064 = × 3 × 3461, so it is divisible by 2.
What are the factors of 83064?
1, 2, 3, 4, 6, 8, 12, 24, 3461, 6922, 10383, 13844, 20766, 27688, 41532, 83064.
What is 83064 in binary?
10100010001111000 (hexadecimal 14478, octal 242170).
What is the square root of 83064?
About 288.2083, exactly 2√20766.
Is 83064 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 83064?
It is a composite number with 16 divisors.