Search a number
-
+
111002202201029 is a prime number
BaseRepresentation
bin11001001111010010110110…
…110101001101101111000101
3112120000201002022210121111012
4121033102312311031233011
5104022130002230413104
61032025412511052005
732244434022623006
oct3117226665155705
9476021068717435
10111002202201029
1132406851359337
1210548b78b11005
1349c260288c419
141d5a76ca391ad
15cc764e47cd6e
hex64f4b6d4dbc5

111002202201029 has 2 divisors, whose sum is σ = 111002202201030. Its totient is φ = 111002202201028.

The previous prime is 111002202200999. The next prime is 111002202201053. The reversal of 111002202201029 is 920102202200111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 85437023536225 + 25565178664804 = 9243215^2 + 5056202^2 .

It is a cyclic number.

It is not a de Polignac number, because 111002202201029 - 236 = 110933482724293 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2111002202201029 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 288, while the sum is 23.

The spelling of 111002202201029 in words is "one hundred eleven trillion, two billion, two hundred two million, two hundred one thousand, twenty-nine".