The number 55861
55861 is a composite number with 4 divisors. Its prime factorisation is 13 × 4297. Divisors (4): 1, 13, 4297, 55861.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55861: a semiprime: 13 × 4297, the product of two primes.
- 2
55861 is composite. Its prime factorisation is
- 3
The divisors add up to 60172; without 55861 itself that is 4311, so 55861 is deficient (4311 is less than 55861). Euler's totient φ(55861) = 51552 numbers up to 55861 share no factor with it.
- 4
The digits of 55861 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
\[ 55861 = 13 \times 4297 \]
55861 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 60172 |
| Euler totient φ(n) | 51552 |
| Square | 3120451321 |
| Cube | 174311531242381 |
| Square root | 236.349318 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.5861 × |
55861 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand eight hundred and sixty-one |
| Binary (base 2) | 1101101000110101 |
| Octal (base 8) | 155065 |
| Hexadecimal (base 16) | DA35 |
| Base 3 | 2211121221 |
| As time | 55861 seconds = 15 h 31 min 1 s |
Is 55861 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 3) | 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 55861 a prime number?
No. 55861 = 13 × 4297, so it is divisible by 13.
What are the factors of 55861?
1, 13, 4297, 55861.
What is 55861 in binary?
1101101000110101 (hexadecimal DA35, octal 155065).
What is the square root of 55861?
About 236.3493.
Is 55861 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 55861?
55861 is a semiprime: 13 × 4297, the product of two primes.