The number 55939
55939 is a composite number with 6 divisors. Its prime factorisation is Ć 331. Divisors (6): 1, 13, 169, 331, 4303, 55939.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55939 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55939 is composite. Its prime factorisation is
- 3
The divisors add up to 60756; without 55939 itself that is 4817, so 55939 is deficient (4817 is less than 55939). Euler's totient Ļ(55939) = 51480 numbers up to 55939 share no factor with it.
- 4
The digits of 55939 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55939 = 13^{2} \times 331 \]55939 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 60756 |
| Euler totient Ļ(n) | 51480 |
| Square | 3129171721 |
| Cube | 175042736901019 |
| Square root | 236.514270 (= 13ā331) |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.5939 Ć |
55939 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and thirty-nine |
| Binary (base 2) | 1101101010000011 |
| Octal (base 8) | 155203 |
| Hexadecimal (base 16) | DA83 |
| Base 3 | 2211201211 |
| As time | 55939 seconds = 15 h 32 min 19 s |
Is 55939 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 2) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55939 a prime number?
No. 55939 = Ć 331, so it is divisible by 13.
What are the factors of 55939?
1, 13, 169, 331, 4303, 55939.
What is 55939 in binary?
1101101010000011 (hexadecimal DA83, octal 155203).
What is the square root of 55939?
About 236.5143, exactly 13ā331.
Is 55939 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 55939?
It is a composite number with 6 divisors.