The number 65461
65461 is a composite number with 6 divisors. Its prime factorisation is Ć 541. Divisors (6): 1, 11, 121, 541, 5951, 65461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
65461 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
65461 is composite. Its prime factorisation is
- 3
The divisors add up to 72086; without 65461 itself that is 6625, so 65461 is deficient (6625 is less than 65461). Euler's totient Ļ(65461) = 59400 numbers up to 65461 share no factor with it.
- 4
The digits of 65461 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 65461 = 11^{2} \times 541 \]65461 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 72086 |
| Euler totient Ļ(n) | 59400 |
| Square | 4285142521 |
| Cube | 280509714567181 |
| Square root | 255.853474 (= 11ā541) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 130 |
| Scientific notation | 6.5461 Ć |
65461 in other forms
| Form | Value |
|---|---|
| In words | sixty-five thousand four hundred and sixty-one |
| Binary (base 2) | 1111111110110101 |
| Octal (base 8) | 177665 |
| Hexadecimal (base 16) | FFB5 |
| Base 3 | 10022210111 |
| As time | 65461 seconds = 18 h 11 min 1 s |
Is 65461 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 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 4) | 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 (65461 Ć· 11 = 5951) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 65461 a prime number?
No. 65461 = Ć 541, so it is divisible by 11.
What are the factors of 65461?
1, 11, 121, 541, 5951, 65461.
What is 65461 in binary?
1111111110110101 (hexadecimal FFB5, octal 177665).
What is the square root of 65461?
About 255.8535, exactly 11ā541.
Is 65461 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 65461?
It is a composite number with 6 divisors.