The number 55961
55961 is a composite number with 4 divisors. Its prime factorisation is 107 × 523. Divisors (4): 1, 107, 523, 55961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55961: a semiprime: 107 × 523, the product of two primes.
- 2
55961 is composite. Its prime factorisation is
- 3
The divisors add up to 56592; without 55961 itself that is 631, so 55961 is deficient (631 is less than 55961). Euler's totient φ(55961) = 55332 numbers up to 55961 share no factor with it.
- 4
The digits of 55961 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55961 = 107 \times 523 \]
55961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 56592 |
| Euler totient φ(n) | 55332 |
| Square | 3131633521 |
| Cube | 175249343468681 |
| Square root | 236.560774 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.5961 × |
55961 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and sixty-one |
| Binary (base 2) | 1101101010011001 |
| Octal (base 8) | 155231 |
| Hexadecimal (base 16) | DA99 |
| Base 3 | 2211202122 |
| As time | 55961 seconds = 15 h 32 min 41 s |
Is 55961 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 3) | 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 8) | 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 4) | 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 55961 a prime number?
No. 55961 = 107 × 523, so it is divisible by 107.
What are the factors of 55961?
1, 107, 523, 55961.
What is 55961 in binary?
1101101010011001 (hexadecimal DA99, octal 155231).
What is the square root of 55961?
About 236.5608.
Is 55961 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 55961?
55961 is a semiprime: 107 × 523, the product of two primes.