Search a number
-
+
11101111093 is a prime number
BaseRepresentation
bin10100101011010110…
…11000001100110101
31001122122200212120201
422111223120030311
5140213341023333
65033315200501
7542044613242
oct122553301465
931578625521
1011101111093
114787319086
1221998a6131
13107bb69ab7
147744b05c9
1544e8b317d
hex295ad8335

11101111093 has 2 divisors, whose sum is σ = 11101111094. Its totient is φ = 11101111092.

The previous prime is 11101111033. The next prime is 11101111117. The reversal of 11101111093 is 39011110111.

It is a happy number.

11101111093 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 11004639409 + 96471684 = 104903^2 + 9822^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-11101111093 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 11101111093.

It is a congruent number.

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

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

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

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

Almost surely, 211101111093 is an apocalyptic number.

It is an amenable number.

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

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

11101111093 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 19.

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