The number 64461
64461 is a composite number with 4 divisors. Its prime factorisation is 3 × 21487. Divisors (4): 1, 3, 21487, 64461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 64461: a semiprime: 3 × 21487, the product of two primes.
- 2
64461 is composite. Its prime factorisation is
- 3
The divisors add up to 85952; without 64461 itself that is 21491, so 64461 is deficient (21491 is less than 64461). Euler's totient φ(64461) = 42972 numbers up to 64461 share no factor with it.
- 4
The digits of 64461 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 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64461 = 3 \times 21487 \]
64461 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 85952 |
| Euler totient φ(n) | 42972 |
| Square | 4155220521 |
| Cube | 267849670004181 |
| Square root | 253.891709 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 130 |
| Scientific notation | 6.4461 × |
64461 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand four hundred and sixty-one |
| Binary (base 2) | 1111101111001101 |
| Octal (base 8) | 175715 |
| Hexadecimal (base 16) | FBCD |
| Base 3 | 10021102110 |
| As time | 64461 seconds = 17 h 54 min 21 s |
Is 64461 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 (64461 ÷ 3 = 21487) | 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 | 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 5) | 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 1) | 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 64461 a prime number?
No. 64461 = 3 × 21487, so it is divisible by 3.
What are the factors of 64461?
1, 3, 21487, 64461.
What is 64461 in binary?
1111101111001101 (hexadecimal FBCD, octal 175715).
What is the square root of 64461?
About 253.8917.
Is 64461 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 64461?
64461 is a semiprime: 3 × 21487, the product of two primes.