Search a number
-
+
110101110111121 is a prime number
BaseRepresentation
bin11001000010001011101001…
…100011101011101110010001
3112102211120012200001121112111
4121002023221203223232101
5103412344033142023441
61030055430212225321
732122354101342613
oct3102135143535621
9472746180047474
10110101110111121
11320996893671a8
12104223bb00b241
13495864aa91b8c
141d28cca5b2db3
15cadeb112e081
hex6422e98ebb91

110101110111121 has 2 divisors, whose sum is σ = 110101110111122. Its totient is φ = 110101110111120.

The previous prime is 110101110111101. The next prime is 110101110111137. The reversal of 110101110111121 is 121111011101011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 97011468313600 + 13089641797521 = 9849440^2 + 3617961^2 .

It is a cyclic number.

It is not a de Polignac number, because 110101110111121 - 27 = 110101110110993 is a prime.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 2110101110111121 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2, while the sum is 13.

Adding to 110101110111121 its reverse (121111011101011), we get a palindrome (231212121212132).

The spelling of 110101110111121 in words is "one hundred ten trillion, one hundred one billion, one hundred ten million, one hundred eleven thousand, one hundred twenty-one".