The number 55933
55933 is a twin prime (55931 and 55933 are both prime) and the 5679th prime number. Its only divisors are 1 and 55933.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55933: a twin prime (55931 and 55933 are both prime); the 5679th prime number.
- 2
55933 is prime, so its only factors are 1 and 55933. It is the 5679th prime; the next prime is 55949 and the one before is 55931.
- 3
The divisors add up to 55934; without 55933 itself that is 1, so 55933 is deficient (1 is less than 55933). Euler's totient φ(55933) = 55932 numbers up to 55933 share no factor with it.
- 4
The digits of 55933 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 96 steps to reach 1.
55933 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 55934 |
| Euler totient φ(n) | 55932 |
| Square | 3128500489 |
| Cube | 174986417851237 |
| Square root | 236.501586 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.5933 × |
55933 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and thirty-three |
| Binary (base 2) | 1101101001111101 |
| Octal (base 8) | 155175 |
| Hexadecimal (base 16) | DA7D |
| Base 3 | 2211201121 |
| As time | 55933 seconds = 15 h 32 min 13 s |
Is 55933 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 1) | 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 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 5) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55933 a prime number?
Yes. 55933 is divisible only by 1 and itself.
What are the factors of 55933?
1, 55933.
What is 55933 in binary?
1101101001111101 (hexadecimal DA7D, octal 155175).
What is the square root of 55933?
About 236.5016.
Is 55933 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 55933?
55933 is a twin prime (55931 and 55933 are both prime); the 5679th prime number.