Search a number
-
+
111110010576713 is a prime number
BaseRepresentation
bin11001010000110111010000…
…101101100001111101001001
3112120102000100200021112111022
4121100313100231201331021
5104030411300201423323
61032151122330442225
732255301432660131
oct3120672055417511
9476360320245438
10111110010576713
113244854437a685
1210565a45893375
1349cc823ccb0b5
141d61a78b21ac1
15cca35de604c8
hex650dd0b61f49

111110010576713 has 2 divisors, whose sum is σ = 111110010576714. Its totient is φ = 111110010576712.

The previous prime is 111110010576667. The next prime is 111110010576767. The reversal of 111110010576713 is 317675010011111.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 105167322132544 + 5942688444169 = 10255112^2 + 2437763^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-111110010576713 is a prime.

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

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

Almost surely, 2111110010576713 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 111110010576713 its reverse (317675010011111), we get a palindrome (428785020587824).

The spelling of 111110010576713 in words is "one hundred eleven trillion, one hundred ten billion, ten million, five hundred seventy-six thousand, seven hundred thirteen".