The number 64051
64051 is a composite number with 6 divisors. Its prime factorisation is Ć 379. Divisors (6): 1, 13, 169, 379, 4927, 64051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
64051 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
64051 is composite. Its prime factorisation is
- 3
The divisors add up to 69540; without 64051 itself that is 5489, so 64051 is deficient (5489 is less than 64051). Euler's totient Ļ(64051) = 58968 numbers up to 64051 share no factor with it.
- 4
The digits of 64051 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 86 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64051 = 13^{2} \times 379 \]64051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 69540 |
| Euler totient Ļ(n) | 58968 |
| Square | 4102530601 |
| Cube | 262771187524651 |
| Square root | 253.082990 (= 13ā379) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 86 |
| Scientific notation | 6.4051 Ć |
64051 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand and fifty-one |
| Binary (base 2) | 1111101000110011 |
| Octal (base 8) | 175063 |
| Hexadecimal (base 16) | FA33 |
| Base 3 | 10020212021 |
| As time | 64051 seconds = 17 h 47 min 31 s |
Is 64051 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 64051 a prime number?
No. 64051 = Ć 379, so it is divisible by 13.
What are the factors of 64051?
1, 13, 169, 379, 4927, 64051.
What is 64051 in binary?
1111101000110011 (hexadecimal FA33, octal 175063).
What is the square root of 64051?
About 253.0830, exactly 13ā379.
Is 64051 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 64051?
It is a composite number with 6 divisors.