Search a number
-
+
110110101111149 is a prime number
BaseRepresentation
bin11001000010010100000001…
…011101101000000101101101
3112102212102102021012201220112
4121002110001131220011231
5103413020441341024044
61030103514312425405
732123122644520646
oct3102240135500555
9472772367181815
10110110101111149
11320a2482570637
12104240aa0a8265
134959451710839
141d295007246cd
15cae33a62e09e
hex64250176816d

110110101111149 has 2 divisors, whose sum is σ = 110110101111150. Its totient is φ = 110110101111148.

The previous prime is 110110101111083. The next prime is 110110101111167. The reversal of 110110101111149 is 941111101011011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 101296535485924 + 8813565625225 = 10064618^2 + 2968765^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

Almost surely, 2110110101111149 is an apocalyptic number.

It is an amenable number.

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

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

110110101111149 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 23.

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