The number 55051
55051 is a twin prime (55049 and 55051 are both prime) and the 5595th prime number. Its only divisors are 1 and 55051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55051: a twin prime (55049 and 55051 are both prime); the 5595th prime number.
- 2
55051 is prime, so its only factors are 1 and 55051. It is the 5595th prime; the next prime is 55057 and the one before is 55049.
- 3
The divisors add up to 55052; without 55051 itself that is 1, so 55051 is deficient (1 is less than 55051). Euler's totient φ(55051) = 55050 numbers up to 55051 share no factor with it.
- 4
The digits of 55051 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
55051 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 55052 |
| Euler totient φ(n) | 55050 |
| Square | 3030612601 |
| Cube | 166838254297651 |
| Square root | 234.629495 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.5051 × |
55051 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand and fifty-one |
| Binary (base 2) | 1101011100001011 |
| Octal (base 8) | 153413 |
| Hexadecimal (base 16) | D70B |
| Base 3 | 2210111221 |
| As time | 55051 seconds = 15 h 17 min 31 s |
Is 55051 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 1) | 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 3) | 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 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55051 a prime number?
Yes. 55051 is divisible only by 1 and itself.
What are the factors of 55051?
1, 55051.
What is 55051 in binary?
1101011100001011 (hexadecimal D70B, octal 153413).
What is the square root of 55051?
About 234.6295.
Is 55051 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 55051?
55051 is a twin prime (55049 and 55051 are both prime); the 5595th prime number.