The number 54461
54461 is a composite number with 4 divisors. Its prime factorisation is 11 × 4951. Divisors (4): 1, 11, 4951, 54461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 54461: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 11 × 4951, the product of two primes.
- 2
54461 is composite. Its prime factorisation is
- 3
The divisors add up to 59424; without 54461 itself that is 4963, so 54461 is deficient (4963 is less than 54461). Euler's totient φ(54461) = 49500 numbers up to 54461 share no factor with it.
- 4
The digits of 54461 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 54461 = 11 \times 4951 \]
54461 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 59424 |
| Euler totient φ(n) | 49500 |
| Square | 2966000521 |
| Cube | 161531354374181 |
| Square root | 233.368807 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.4461 × |
54461 in other forms
| Form | Value |
|---|---|
| In words | fifty-four thousand four hundred and sixty-one |
| Binary (base 2) | 1101010010111101 |
| Octal (base 8) | 152275 |
| Hexadecimal (base 16) | D4BD |
| Base 3 | 2202201002 |
| As time | 54461 seconds = 15 h 7 min 41 s |
Is 54461 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 2) | 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 5) | 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 2) | 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 (54461 ÷ 11 = 4951) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 54461 a prime number?
No. 54461 = 11 × 4951, so it is divisible by 11.
What are the factors of 54461?
1, 11, 4951, 54461.
What is 54461 in binary?
1101010010111101 (hexadecimal D4BD, octal 152275).
What is the square root of 54461?
About 233.3688.
Is 54461 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 54461?
54461 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 11 × 4951, the product of two primes.