Search a number
-
+
51162106157 is a prime number
BaseRepresentation
bin101111101001011111…
…111100100100101101
311220001120112021120122
4233221133330210231
51314234444344112
635300433254325
73460562504231
oct575137744455
9156046467518
1051162106157
111a774747668
129aba1043a5
134a947571c6
142694bd85c1
1514e68e7872
hexbe97fc92d

51162106157 has 2 divisors, whose sum is σ = 51162106158. Its totient is φ = 51162106156.

The previous prime is 51162106147. The next prime is 51162106159. The reversal of 51162106157 is 75160126115.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 50846191081 + 315915076 = 225491^2 + 17774^2 .

It is a cyclic number.

It is not a de Polignac number, because 51162106157 - 210 = 51162105133 is a prime.

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

Together with 51162106159, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

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

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

Almost surely, 251162106157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12600, while the sum is 35.

The spelling of 51162106157 in words is "fifty-one billion, one hundred sixty-two million, one hundred six thousand, one hundred fifty-seven".