Search a number
-
+
51015112069 is a prime number
BaseRepresentation
bin101111100000101111…
…001101010110000101
311212200022221012121011
4233200233031112011
51313434332041234
635234102522221
73454126204105
oct574057152605
9155608835534
1051015112069
111a6a9778849
129a78a36371
134a7016b55c
14267d493205
1514d8a5db64
hexbe0bcd585

51015112069 has 2 divisors, whose sum is σ = 51015112070. Its totient is φ = 51015112068.

The previous prime is 51015112063. The next prime is 51015112079. The reversal of 51015112069 is 96021151015.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 47006576100 + 4008535969 = 216810^2 + 63313^2 .

It is a cyclic number.

It is not a de Polignac number, because 51015112069 - 27 = 51015111941 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 51015112069.

It is a congruent number.

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

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

Almost surely, 251015112069 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2700, while the sum is 31.

The spelling of 51015112069 in words is "fifty-one billion, fifteen million, one hundred twelve thousand, sixty-nine".