The number 5461
5461 is a binary palindrome (1010101010101). Its prime factorisation is 43 × 127. Divisors (4): 1, 43, 127, 5461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5461: a binary palindrome (1010101010101); a semiprime: 43 × 127, the product of two primes.
- 2
5461 is composite. Its prime factorisation is
- 3
The divisors add up to 5632; without 5461 itself that is 171, so 5461 is deficient (171 is less than 5461). Euler's totient φ(5461) = 5292 numbers up to 5461 share no factor with it.
- 4
The digits of 5461 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 15 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5461 = 43 \times 127 \]
5461 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 5632 |
| Euler totient φ(n) | 5292 |
| Square | 29822521 |
| Cube | 162860787181 |
| Square root | 73.898579 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 15 |
| Scientific notation | 5.461 × |
5461 in other forms
| Form | Value |
|---|---|
| In words | five thousand four hundred and sixty-one |
| Binary (base 2) | 1010101010101 |
| Octal (base 8) | 12525 |
| Hexadecimal (base 16) | 1555 |
| Base 3 | 21111021 |
| As time | 5461 seconds = 1 h 31 min 1 s |
Is 5461 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 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 5) | 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 5) | 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 5461 a prime number?
No. 5461 = 43 × 127, so it is divisible by 43.
What are the factors of 5461?
1, 43, 127, 5461.
What is 5461 in binary?
1010101010101 (hexadecimal 1555, octal 12525).
What is the square root of 5461?
About 73.8986.
Is 5461 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 5461?
5461 is a binary palindrome (1010101010101); a semiprime: 43 × 127, the product of two primes.