Search a number
-
+
27775505551 is a prime number
BaseRepresentation
bin11001110111100011…
…001001010010001111
32122200201111212122211
4121313203021102033
5423341012134201
620432045251251
72002205621203
oct316743112217
978621455584
1027775505551
1110863604472
125471b63b27
1328085686b1
1414b6c32b03
15ac86be651
hex6778c948f

27775505551 has 2 divisors, whose sum is σ = 27775505552. Its totient is φ = 27775505550.

The previous prime is 27775505503. The next prime is 27775505587. The reversal of 27775505551 is 15550557772.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 27775505551 - 29 = 27775505039 is a prime.

It is a super-2 number, since 2×277755055512 (a number of 22 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 27775505495 and 27775505504.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (27775505501) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13887752775 + 13887752776.

It is an arithmetic number, because the mean of its divisors is an integer number (13887752776).

Almost surely, 227775505551 is an apocalyptic number.

27775505551 is a deficient number, since it is larger than the sum of its proper divisors (1).

27775505551 is an equidigital number, since it uses as much as digits as its factorization.

27775505551 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 2143750, while the sum is 49.

The spelling of 27775505551 in words is "twenty-seven billion, seven hundred seventy-five million, five hundred five thousand, five hundred fifty-one".