Search a number
-
+
50011111121 is a prime number
BaseRepresentation
bin101110100100111001…
…001111111011010001
311210002100201200012212
4232210321033323101
51304410321023441
634550315401505
73420215300456
oct564471177321
9153070650185
1050011111121
111a233a71aa4
129838753295
13494016025a
1425c5dc382d
15147a83beeb
hexba4e4fed1

50011111121 has 2 divisors, whose sum is σ = 50011111122. Its totient is φ = 50011111120.

The previous prime is 50011111093. The next prime is 50011111127. The reversal of 50011111121 is 12111111005.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 33375270721 + 16635840400 = 182689^2 + 128980^2 .

It is a cyclic number.

It is not a de Polignac number, because 50011111121 - 218 = 50010848977 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

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

Almost surely, 250011111121 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10, while the sum is 14.

Adding to 50011111121 its reverse (12111111005), we get a palindrome (62122222126).

The spelling of 50011111121 in words is "fifty billion, eleven million, one hundred eleven thousand, one hundred twenty-one".