The number 64092
64092 is a composite number with 36 divisors. Its prime factorisation is × 3 × × 109. Divisors (36): 1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 49, 84, 98, 109, 147 … 64092.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 64092: a Harshad number: divisible by its digit sum 21.
- 2
64092 is composite. Its prime factorisation is
- 3
The divisors add up to 175560; without 64092 itself that is 111468, so 64092 is abundant (111468 is more than 64092). Euler's totient φ(64092) = 18144 numbers up to 64092 share no factor with it.
- 4
The digits of 64092 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 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64092 = 2^{2} \times 3 \times 7^{2} \times 109 \]64092 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 36 |
| Sum of divisors | 175560 |
| Euler totient φ(n) | 18144 |
| Square | 4107784464 |
| Cube | 263276121866688 |
| Square root | 253.163978 (= 14√327) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.4092 × |
64092 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand and ninety-two |
| Binary (base 2) | 1111101001011100 |
| Octal (base 8) | 175134 |
| Hexadecimal (base 16) | FA5C |
| Base 3 | 10020220210 |
| As time | 64092 seconds = 17 h 48 min 12 s |
Is 64092 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (64092 ÷ 2 = 32046) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (64092 ÷ 3 = 21364) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (64092 ÷ 4 = 16023) | 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 | Yes (64092 ÷ 6 = 10682) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (64092 ÷ 7 = 9156) | 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 3) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (64092 ÷ 12 = 5341) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 64092 a prime number?
No. 64092 = × 3 × × 109, so it is divisible by 2.
What are the factors of 64092?
1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 49, 84, 98, 109, 147, 196, 218, 294, 327, 436, 588, 654, 763, 1308, 1526, 2289, 3052, 4578, 5341, 9156, 10682, 16023, 21364, 32046, 64092.
What is 64092 in binary?
1111101001011100 (hexadecimal FA5C, octal 175134).
What is the square root of 64092?
About 253.1640, exactly 14√327.
Is 64092 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 64092?
64092 is a Harshad number: divisible by its digit sum 21.