The number 55931
55931 is a twin prime (55931 and 55933 are both prime) and the 5678th prime number. Its only divisors are 1 and 55931.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55931: a twin prime (55931 and 55933 are both prime); the 5678th prime number.
- 2
55931 is prime, so its only factors are 1 and 55931. It is the 5678th prime; the next prime is 55933 and the one before is 55927.
- 3
The divisors add up to 55932; without 55931 itself that is 1, so 55931 is deficient (1 is less than 55931). Euler's totient φ(55931) = 55930 numbers up to 55931 share no factor with it.
- 4
The digits of 55931 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
55931 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 55932 |
| Euler totient φ(n) | 55930 |
| Square | 3128276761 |
| Cube | 174967647519491 |
| Square root | 236.497357 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.5931 × |
55931 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and thirty-one |
| Binary (base 2) | 1101101001111011 |
| Octal (base 8) | 155173 |
| Hexadecimal (base 16) | DA7B |
| Base 3 | 2211201112 |
| As time | 55931 seconds = 15 h 32 min 11 s |
Is 55931 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 1) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55931 a prime number?
Yes. 55931 is divisible only by 1 and itself.
What are the factors of 55931?
1, 55931.
What is 55931 in binary?
1101101001111011 (hexadecimal DA7B, octal 155173).
What is the square root of 55931?
About 236.4974.
Is 55931 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 55931?
55931 is a twin prime (55931 and 55933 are both prime); the 5678th prime number.