Search a number
-
+
10111102009 is a prime number
BaseRepresentation
bin10010110101010101…
…10010110000111001
3222002122211012102121
421122222302300321
5131201420231014
64351152001241
7505363643341
oct113252626071
928078735377
1010111102009
1143194a9658
121b62230221
13c51a1a2c8
146bcc03d21
153e2a07124
hex25aab2c39

10111102009 has 2 divisors, whose sum is σ = 10111102010. Its totient is φ = 10111102008.

The previous prime is 10111101983. The next prime is 10111102033. The reversal of 10111102009 is 90020111101.

10111102009 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., 8043399225 + 2067702784 = 89685^2 + 45472^2 .

It is a cyclic number.

It is not a de Polignac number, because 10111102009 - 219 = 10110577721 is a prime.

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

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

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

Almost surely, 210111102009 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 10111102009 in words is "ten billion, one hundred eleven million, one hundred two thousand, nine".