Search a number
-
+
11000220109 is a prime number
BaseRepresentation
bin10100011111010101…
…00000100111001101
31001101121212002011121
422033222200213031
5140012024020414
65015312520541
7536411220364
oct121752404715
931347762147
1011000220109
1147353791aa
12216bb50151
131063ca38a8
14764d2a7db
15445ad4724
hex28faa09cd

11000220109 has 2 divisors, whose sum is σ = 11000220110. Its totient is φ = 11000220108.

The previous prime is 11000220089. The next prime is 11000220113. The reversal of 11000220109 is 90102200011.

11000220109 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., 10964184100 + 36036009 = 104710^2 + 6003^2 .

It is a cyclic number.

It is not a de Polignac number, because 11000220109 - 27 = 11000219981 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 11000220092 and 11000220101.

It is a congruent number.

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

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

Almost surely, 211000220109 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 36, while the sum is 16.

The spelling of 11000220109 in words is "eleven billion, two hundred twenty thousand, one hundred nine".