The number 55943
55943 is a composite number with 4 divisors. Its prime factorisation is 43 × 1301. Divisors (4): 1, 43, 1301, 55943.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55943: a semiprime: 43 × 1301, the product of two primes.
- 2
55943 is composite. Its prime factorisation is
- 3
The divisors add up to 57288; without 55943 itself that is 1345, so 55943 is deficient (1345 is less than 55943). Euler's totient φ(55943) = 54600 numbers up to 55943 share no factor with it.
- 4
The digits of 55943 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
\[ 55943 = 43 \times 1301 \]
55943 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 57288 |
| Euler totient φ(n) | 54600 |
| Square | 3129619249 |
| Cube | 175080289646807 |
| Square root | 236.522726 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.5943 × |
55943 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and forty-three |
| Binary (base 2) | 1101101010000111 |
| Octal (base 8) | 155207 |
| Hexadecimal (base 16) | DA87 |
| Base 3 | 2211201222 |
| As time | 55943 seconds = 15 h 32 min 23 s |
Is 55943 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 6) | 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 7) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55943 a prime number?
No. 55943 = 43 × 1301, so it is divisible by 43.
What are the factors of 55943?
1, 43, 1301, 55943.
What is 55943 in binary?
1101101010000111 (hexadecimal DA87, octal 155207).
What is the square root of 55943?
About 236.5227.
Is 55943 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 55943?
55943 is a semiprime: 43 × 1301, the product of two primes.