The number 64022
64022 is a composite number with 16 divisors. Its prime factorisation is 2 × 7 × 17 × 269. Divisors (16): 1, 2, 7, 14, 17, 34, 119, 238, 269, 538, 1883, 3766, 4573, 9146, 32011, 64022.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 64022: a Harshad number: divisible by its digit sum 14.
- 2
64022 is composite. Its prime factorisation is
- 3
The divisors add up to 116640; without 64022 itself that is 52618, so 64022 is deficient (52618 is less than 64022). Euler's totient φ(64022) = 25728 numbers up to 64022 share no factor with it.
- 4
The digits of 64022 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 86 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64022 = 2 \times 7 \times 17 \times 269 \]
64022 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 116640 |
| Euler totient φ(n) | 25728 |
| Square | 4098816484 |
| Cube | 262414428938648 |
| Square root | 253.025690 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 86 |
| Scientific notation | 6.4022 × |
64022 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand and twenty-two |
| Binary (base 2) | 1111101000010110 |
| Octal (base 8) | 175026 |
| Hexadecimal (base 16) | FA16 |
| Base 3 | 10020211012 |
| As time | 64022 seconds = 17 h 47 min 2 s |
Is 64022 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (64022 ÷ 2 = 32011) | 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 | No (remainder 2) | 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 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (64022 ÷ 7 = 9146) | 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 6) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 64022 a prime number?
No. 64022 = 2 × 7 × 17 × 269, so it is divisible by 2.
What are the factors of 64022?
1, 2, 7, 14, 17, 34, 119, 238, 269, 538, 1883, 3766, 4573, 9146, 32011, 64022.
What is 64022 in binary?
1111101000010110 (hexadecimal FA16, octal 175026).
What is the square root of 64022?
About 253.0257.
Is 64022 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 64022?
64022 is a Harshad number: divisible by its digit sum 14.