Search a number
-
+
11091109223 is a prime number
BaseRepresentation
bin10100101010001010…
…01110010101100111
31001121221212201121002
422111011032111213
5140203310443343
65032320543515
7541563605255
oct122505162547
931557781532
1011091109223
114781707577
122196481b9b
131079a7742c
147730295d5
1544da898b8
hex29514e567

11091109223 has 2 divisors, whose sum is σ = 11091109224. Its totient is φ = 11091109222.

The previous prime is 11091109193. The next prime is 11091109231. The reversal of 11091109223 is 32290119011.

11091109223 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 is an emirp because it is prime and its reverse (32290119011) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 11091109223 - 210 = 11091108199 is a prime.

It is a congruent number.

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

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

Almost surely, 211091109223 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 972, while the sum is 29.

The spelling of 11091109223 in words is "eleven billion, ninety-one million, one hundred nine thousand, two hundred twenty-three".