100000011011093 has 2 divisors, whose sum is σ = 100000011011094. Its totient is φ = 100000011011092.

The previous prime is 100000011011039. The next prime is 100000011011129. The reversal of 100000011011093 is 390110110000001.

Together with previous prime (100000011011039) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 93891313201009 + 6108697810084 = 9689753^2 + 2471578^2 .

It is a cyclic number.

It is not a de Polignac number, because 100000011011093 - 2¹² = 100000011006997 is a prime.

It is a congruent number.

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

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

Almost surely, 2^{100000011011093} is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 27, while the sum is 17.

Adding to 100000011011093 its reverse (390110110000001), we get a palindrome (490110121011094).

The spelling of 100000011011093 in words is "one hundred trillion, eleven million, eleven thousand, ninety-three".