The number 54961
54961 is a composite number with 8 divisors. Its prime factorisation is 17 × 53 × 61. Divisors (8): 1, 17, 53, 61, 901, 1037, 3233, 54961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
54961 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
54961 is composite. Its prime factorisation is
- 3
The divisors add up to 60264; without 54961 itself that is 5303, so 54961 is deficient (5303 is less than 54961). Euler's totient φ(54961) = 49920 numbers up to 54961 share no factor with it.
- 4
The digits of 54961 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 54961 = 17 \times 53 \times 61 \]
54961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 60264 |
| Euler totient φ(n) | 49920 |
| Square | 3020711521 |
| Cube | 166021325905681 |
| Square root | 234.437625 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.4961 × |
54961 in other forms
| Form | Value |
|---|---|
| In words | fifty-four thousand nine hundred and sixty-one |
| Binary (base 2) | 1101011010110001 |
| Octal (base 8) | 153261 |
| Hexadecimal (base 16) | D6B1 |
| Base 3 | 2210101121 |
| As time | 54961 seconds = 15 h 16 min 1 s |
Is 54961 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 1) | 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 54961 a prime number?
No. 54961 = 17 × 53 × 61, so it is divisible by 17.
What are the factors of 54961?
1, 17, 53, 61, 901, 1037, 3233, 54961.
What is 54961 in binary?
1101011010110001 (hexadecimal D6B1, octal 153261).
What is the square root of 54961?
About 234.4376.
Is 54961 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 54961?
It is a composite number with 8 divisors.