Search a number
-
+
111101001081061 is a prime number
BaseRepresentation
bin11001010000101110110111…
…101101000010000011100101
3112120101011002210022201220011
4121100232313231002003211
5104030234322234043221
61032143032330010221
732254532243350015
oct3120566755020345
9476334083281804
10111101001081061
1132444740793202
1210564150576971
1349cba195a4994
141d61462357c45
15cc9ed300a1e1
hex650bb7b420e5

111101001081061 has 2 divisors, whose sum is σ = 111101001081062. Its totient is φ = 111101001081060.

The previous prime is 111101001081023. The next prime is 111101001081067. The reversal of 111101001081061 is 160180100101111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 105727441288225 + 5373559792836 = 10282385^2 + 2318094^2 .

It is a cyclic number.

It is not a de Polignac number, because 111101001081061 - 237 = 110963562127589 is a prime.

It is a congruent number.

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

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

Almost surely, 2111101001081061 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 111101001081061 its reverse (160180100101111), we get a palindrome (271281101182172).

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