Search a number
-
+
111101010110161 is a prime number
BaseRepresentation
bin11001010000101110111000…
…001111011110011011010001
3112120101011010102022110111021
4121100232320033132123101
5104030234332042011121
61032143033251315441
732254532413163641
oct3120567017363321
9476334112273437
10111101010110161
113244474589a975
12105641535abb81
1349cba1b416646
141d61463628521
15cc9ed3be0641
hex650bb83de6d1

111101010110161 has 2 divisors, whose sum is σ = 111101010110162. Its totient is φ = 111101010110160.

The previous prime is 111101010110159. The next prime is 111101010110221. The reversal of 111101010110161 is 161011010101111.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 60270612462225 + 50830397647936 = 7763415^2 + 7129544^2 .

It is a cyclic number.

It is not a de Polignac number, because 111101010110161 - 21 = 111101010110159 is a prime.

Together with 111101010110159, it forms a pair of twin primes.

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

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

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

Almost surely, 2111101010110161 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6, while the sum is 16.

Adding to 111101010110161 its reverse (161011010101111), we get a palindrome (272112020211272).

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