The number 55942
55942 is a composite number with 8 divisors. Its prime factorisation is 2 × 83 × 337. Divisors (8): 1, 2, 83, 166, 337, 674, 27971, 55942.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55942 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55942 is composite. Its prime factorisation is
- 3
The divisors add up to 85176; without 55942 itself that is 29234, so 55942 is deficient (29234 is less than 55942). Euler's totient φ(55942) = 27552 numbers up to 55942 share no factor with it.
- 4
The digits of 55942 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 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55942 = 2 \times 83 \times 337 \]
55942 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 85176 |
| Euler totient φ(n) | 27552 |
| Square | 3129507364 |
| Cube | 175070900956888 |
| Square root | 236.520612 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.5942 × |
55942 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and forty-two |
| Binary (base 2) | 1101101010000110 |
| Octal (base 8) | 155206 |
| Hexadecimal (base 16) | DA86 |
| Base 3 | 2211201221 |
| As time | 55942 seconds = 15 h 32 min 22 s |
Is 55942 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55942 ÷ 2 = 27971) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 6) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55942 a prime number?
No. 55942 = 2 × 83 × 337, so it is divisible by 2.
What are the factors of 55942?
1, 2, 83, 166, 337, 674, 27971, 55942.
What is 55942 in binary?
1101101010000110 (hexadecimal DA86, octal 155206).
What is the square root of 55942?
About 236.5206.
Is 55942 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 55942?
It is a composite number with 8 divisors.