The number 55937
55937 is a composite number with 8 divisors. Its prime factorisation is 7 × 61 × 131. Divisors (8): 1, 7, 61, 131, 427, 917, 7991, 55937.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55937 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55937 is composite. Its prime factorisation is
- 3
The divisors add up to 65472; without 55937 itself that is 9535, so 55937 is deficient (9535 is less than 55937). Euler's totient φ(55937) = 46800 numbers up to 55937 share no factor with it.
- 4
The digits of 55937 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 184 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55937 = 7 \times 61 \times 131 \]
55937 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 65472 |
| Euler totient φ(n) | 46800 |
| Square | 3128947969 |
| Cube | 175023962541953 |
| Square root | 236.510042 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 184 |
| Scientific notation | 5.5937 × |
55937 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and thirty-seven |
| Binary (base 2) | 1101101010000001 |
| Octal (base 8) | 155201 |
| Hexadecimal (base 16) | DA81 |
| Base 3 | 2211201202 |
| As time | 55937 seconds = 15 h 32 min 17 s |
Is 55937 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 2) | 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 | Yes (55937 ÷ 7 = 7991) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 55937 a prime number?
No. 55937 = 7 × 61 × 131, so it is divisible by 7.
What are the factors of 55937?
1, 7, 61, 131, 427, 917, 7991, 55937.
What is 55937 in binary?
1101101010000001 (hexadecimal DA81, octal 155201).
What is the square root of 55937?
About 236.5100.
Is 55937 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 55937?
It is a composite number with 8 divisors.