The number 64251
64251 is a composite number with 18 divisors. Its prime factorisation is × × 59. Divisors (18): 1, 3, 9, 11, 33, 59, 99, 121, 177, 363, 531, 649, 1089, 1947, 5841, 7139 … 64251.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 64251: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
64251 is composite. Its prime factorisation is
- 3
The divisors add up to 103740; without 64251 itself that is 39489, so 64251 is deficient (39489 is less than 64251). Euler's totient φ(64251) = 38280 numbers up to 64251 share no factor with it.
- 4
The digits of 64251 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 236 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64251 = 3^{2} \times 11^{2} \times 59 \]64251 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 103740 |
| Euler totient φ(n) | 38280 |
| Square | 4128191001 |
| Cube | 265240400005251 |
| Square root | 253.477810 (= 33√59) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 236 |
| Scientific notation | 6.4251 × |
64251 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand two hundred and fifty-one |
| Binary (base 2) | 1111101011111011 |
| Octal (base 8) | 175373 |
| Hexadecimal (base 16) | FAFB |
| Base 3 | 10021010200 |
| As time | 64251 seconds = 17 h 50 min 51 s |
Is 64251 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 | Yes (64251 ÷ 3 = 21417) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 | Yes (64251 ÷ 9 = 7139) | 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 | Yes (64251 ÷ 11 = 5841) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 64251 a prime number?
No. 64251 = × × 59, so it is divisible by 3.
What are the factors of 64251?
1, 3, 9, 11, 33, 59, 99, 121, 177, 363, 531, 649, 1089, 1947, 5841, 7139, 21417, 64251.
What is 64251 in binary?
1111101011111011 (hexadecimal FAFB, octal 175373).
What is the square root of 64251?
About 253.4778, exactly 33√59.
Is 64251 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 64251?
64251 is a happy number: repeatedly adding the squares of its digits reaches 1.