Search a number
-
+
111101001011149 is a prime number
BaseRepresentation
bin11001010000101110110111…
…101100110000111111001101
3112120101011002210012011222211
4121100232313230300333031
5104030234322224324044
61032143032324310421
732254532242636132
oct3120566754607715
9476334083164884
10111101001011149
1132444740745726
1210564150542411
1349cba1957bc06
141d6146233a589
15cc9ed2ee4634
hex650bb7b30fcd

111101001011149 has 2 divisors, whose sum is σ = 111101001011150. Its totient is φ = 111101001011148.

The previous prime is 111101001011089. The next prime is 111101001011243. The reversal of 111101001011149 is 941110100101111.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 59856062688900 + 51244938322249 = 7736670^2 + 7158557^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 111101001011149 - 211 = 111101001009101 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2111101001011149 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 36, while the sum is 22.

The spelling of 111101001011149 in words is "one hundred eleven trillion, one hundred one billion, one million, eleven thousand, one hundred forty-nine".