Search a number
-
+
51051161101 is a prime number
BaseRepresentation
bin101111100010111000…
…101110011000001101
311212202211202200120111
4233202320232120031
51314023044123401
635241431320021
73455044465243
oct574270563015
9155684680514
1051051161101
111a71805aa36
129a88b20011
134a77780945
142684198793
1514dbccee51
hexbe2e2e60d

51051161101 has 2 divisors, whose sum is σ = 51051161102. Its totient is φ = 51051161100.

The previous prime is 51051161059. The next prime is 51051161113. The reversal of 51051161101 is 10116115015.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 49869589225 + 1181571876 = 223315^2 + 34374^2 .

It is a cyclic number.

It is not a de Polignac number, because 51051161101 - 225 = 51017606669 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (51051165101) 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, 25525580550 + 25525580551.

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

Almost surely, 251051161101 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 150, while the sum is 22.

Adding to 51051161101 its reverse (10116115015), we get a palindrome (61167276116).

The spelling of 51051161101 in words is "fifty-one billion, fifty-one million, one hundred sixty-one thousand, one hundred one".