The number 55938
55938 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 9323. Divisors (8): 1, 2, 3, 6, 9323, 18646, 27969, 55938.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55938 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55938 is composite. Its prime factorisation is
- 3
The divisors add up to 111888; without 55938 itself that is 55950, so 55938 is abundant (55950 is more than 55938). Euler's totient φ(55938) = 18644 numbers up to 55938 share no factor with it.
- 4
The digits of 55938 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55938 = 2 \times 3 \times 9323 \]
55938 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 111888 |
| Euler totient φ(n) | 18644 |
| Square | 3129059844 |
| Cube | 175033349553672 |
| Square root | 236.512156 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.5938 × |
55938 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and thirty-eight |
| Binary (base 2) | 1101101010000010 |
| Octal (base 8) | 155202 |
| Hexadecimal (base 16) | DA82 |
| Base 3 | 2211201210 |
| As time | 55938 seconds = 15 h 32 min 18 s |
Is 55938 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55938 ÷ 2 = 27969) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (55938 ÷ 3 = 18646) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (55938 ÷ 6 = 9323) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55938 a prime number?
No. 55938 = 2 × 3 × 9323, so it is divisible by 2.
What are the factors of 55938?
1, 2, 3, 6, 9323, 18646, 27969, 55938.
What is 55938 in binary?
1101101010000010 (hexadecimal DA82, octal 155202).
What is the square root of 55938?
About 236.5122.
Is 55938 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 55938?
It is a composite number with 8 divisors.