The number 64281
64281 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 3061. Divisors (8): 1, 3, 7, 21, 3061, 9183, 21427, 64281.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 64281: a Harshad number: divisible by its digit sum 21.
- 2
64281 is composite. Its prime factorisation is
- 3
The divisors add up to 97984; without 64281 itself that is 33703, so 64281 is deficient (33703 is less than 64281). Euler's totient φ(64281) = 36720 numbers up to 64281 share no factor with it.
- 4
The digits of 64281 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 192 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64281 = 3 \times 7 \times 3061 \]
64281 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 97984 |
| Euler totient φ(n) | 36720 |
| Square | 4132046961 |
| Cube | 265612110700041 |
| Square root | 253.536980 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 192 |
| Scientific notation | 6.4281 × |
64281 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand two hundred and eighty-one |
| Binary (base 2) | 1111101100011001 |
| Octal (base 8) | 175431 |
| Hexadecimal (base 16) | FB19 |
| Base 3 | 10021011210 |
| As time | 64281 seconds = 17 h 51 min 21 s |
Is 64281 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 (64281 ÷ 3 = 21427) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 | Yes (64281 ÷ 7 = 9183) | 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 1) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 64281 a prime number?
No. 64281 = 3 × 7 × 3061, so it is divisible by 3.
What are the factors of 64281?
1, 3, 7, 21, 3061, 9183, 21427, 64281.
What is 64281 in binary?
1111101100011001 (hexadecimal FB19, octal 175431).
What is the square root of 64281?
About 253.5370.
Is 64281 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 64281?
64281 is a Harshad number: divisible by its digit sum 21.