The number 92064
92064 is a composite number with 48 divisors. Its prime factorisation is × 3 × 7 × 137. Divisors (48): 1, 2, 3, 4, 6, 7, 8, 12, 14, 16, 21, 24, 28, 32, 42, 48 … 92064.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 92064: a Harshad number: divisible by its digit sum 21.
- 2
92064 is composite. Its prime factorisation is
- 3
The divisors add up to 278208; without 92064 itself that is 186144, so 92064 is abundant (186144 is more than 92064). Euler's totient φ(92064) = 26112 numbers up to 92064 share no factor with it.
- 4
The digits of 92064 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 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 92064 = 2^{5} \times 3 \times 7 \times 137 \]92064 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 278208 |
| Euler totient φ(n) | 26112 |
| Square | 8475780096 |
| Cube | 780314218758144 |
| Square root | 303.420500 (= 4√5754) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 58 |
| Scientific notation | 9.2064 × |
92064 in other forms
| Form | Value |
|---|---|
| In words | ninety-two thousand and sixty-four |
| Binary (base 2) | 10110011110100000 |
| Octal (base 8) | 263640 |
| Hexadecimal (base 16) | 167A0 |
| Base 3 | 11200021210 |
| As time | 92064 seconds = 25 h 34 min 24 s |
Is 92064 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (92064 ÷ 2 = 46032) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (92064 ÷ 3 = 30688) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (92064 ÷ 4 = 23016) | 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 (92064 ÷ 6 = 15344) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (92064 ÷ 7 = 13152) | 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 (92064 ÷ 8 = 11508) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (92064 ÷ 12 = 7672) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 92064 a prime number?
No. 92064 = × 3 × 7 × 137, so it is divisible by 2.
What are the factors of 92064?
1, 2, 3, 4, 6, 7, 8, 12, 14, 16, 21, 24, 28, 32, 42, 48, 56, 84, 96, 112, 137, 168, 224, 274, 336, 411, 548, 672, 822, 959, 1096, 1644, 1918, 2192, 2877, 3288, 3836, 4384, 5754, 6576, 7672, 11508, 13152, 15344, 23016, 30688, 46032, 92064.
What is 92064 in binary?
10110011110100000 (hexadecimal 167A0, octal 263640).
What is the square root of 92064?
About 303.4205, exactly 4√5754.
Is 92064 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 92064?
92064 is a Harshad number: divisible by its digit sum 21.