Search a number
-
+
111131103030329 is a prime number
BaseRepresentation
bin11001010001001010111001…
…111010110110110000111001
3112120111000210122110012101002
4121101022321322312300321
5104031232444333432304
61032204531323134345
732256646221610034
oct3121127172666071
9476430718405332
10111131103030329
113245648852a228
1210569b516743b5
134a01805b13895
141d62aba14001b
15ccab95a7131e
hex6512b9eb6c39

111131103030329 has 2 divisors, whose sum is σ = 111131103030330. Its totient is φ = 111131103030328.

The previous prime is 111131103030281. The next prime is 111131103030347. The reversal of 111131103030329 is 923030301131111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 62852549761600 + 48278553268729 = 7927960^2 + 6948277^2 .

It is an emirp because it is prime and its reverse (923030301131111) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 111131103030329 - 212 = 111131103026233 is a prime.

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

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

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

Almost surely, 2111131103030329 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1458, while the sum is 29.

The spelling of 111131103030329 in words is "one hundred eleven trillion, one hundred thirty-one billion, one hundred three million, thirty thousand, three hundred twenty-nine".