Search a number
-
+
111001010161 is a prime number
BaseRepresentation
bin110011101100000101…
…1001111111111110001
3101121111211222120011111
41213120023033333301
53304312224311121
6122554304513321
711006465006266
oct1473013177761
9347454876144
10111001010161
11430911a3938
121961a01b841
13a60c9cbb02
14553011526d
152d49e282e1
hex19d82cfff1

111001010161 has 2 divisors, whose sum is σ = 111001010162. Its totient is φ = 111001010160.

The previous prime is 111001010101. The next prime is 111001010177. The reversal of 111001010161 is 161010100111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 82516009536 + 28485000625 = 287256^2 + 168775^2 .

It is a cyclic number.

It is not a de Polignac number, because 111001010161 - 29 = 111001009649 is a prime.

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

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

Almost surely, 2111001010161 is an apocalyptic number.

It is an amenable number.

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

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

111001010161 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 13.

Adding to 111001010161 its reverse (161010100111), we get a palindrome (272011110272).

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