Search a number
-
+
111545345029 is a prime number
BaseRepresentation
bin110011111100010011…
…1101110010000000101
3101122220210020122020011
41213320213232100011
53311421102020104
6123124311510221
711026124534356
oct1477047562005
9348823218204
10111545345029
1143340491768
1219750388371
13a698707851
14558252bd2d
152d7caec904
hex19f89ee405

111545345029 has 2 divisors, whose sum is σ = 111545345030. Its totient is φ = 111545345028.

The previous prime is 111545344921. The next prime is 111545345069. The reversal of 111545345029 is 920543545111.

It is an a-pointer prime, because the next prime (111545345069) can be obtained adding 111545345029 to its sum of digits (40).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 58262856129 + 53282488900 = 241377^2 + 230830^2 .

It is a cyclic number.

It is not a de Polignac number, because 111545345029 - 221 = 111543247877 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2111545345029 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 108000, while the sum is 40.

The spelling of 111545345029 in words is "one hundred eleven billion, five hundred forty-five million, three hundred forty-five thousand, twenty-nine".