Search a number
-
+
20114920757 is a prime number
BaseRepresentation
bin10010101110111100…
…010101010100110101
31220220211202211220002
4102232330111110311
5312143404431012
613123552321045
71311316001561
oct225674252465
956824684802
1020114920757
118592391758
123a94543185
131b87443999
14d8b67c6a1
157cadbb7c2
hex4aef15535

20114920757 has 2 divisors, whose sum is σ = 20114920758. Its totient is φ = 20114920756.

The previous prime is 20114920751. The next prime is 20114920783. The reversal of 20114920757 is 75702941102.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 11041596241 + 9073324516 = 105079^2 + 95254^2 .

It is a cyclic number.

It is not a de Polignac number, because 20114920757 - 228 = 19846485301 is a prime.

It is a super-2 number, since 2×201149207572 (a number of 21 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 20114920757.

It is a congruent number.

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

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

Almost surely, 220114920757 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 35280, while the sum is 38.

The spelling of 20114920757 in words is "twenty billion, one hundred fourteen million, nine hundred twenty thousand, seven hundred fifty-seven".