Search a number
-
+
11122003729 is a prime number
BaseRepresentation
bin10100101101110110…
…00100111100010001
31001201010000022220001
422112323010330101
5140234213104404
65035343050001
7542420320564
oct122673047421
931633008801
1011122003729
114798099021
1221a48a0901
1310832a35c5
1477718c4db
1545163d7a4
hex296ec4f11

11122003729 has 2 divisors, whose sum is σ = 11122003730. Its totient is φ = 11122003728.

The previous prime is 11122003709. The next prime is 11122003741. The reversal of 11122003729 is 92730022111.

11122003729 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., 7455459025 + 3666544704 = 86345^2 + 60552^2 .

It is a cyclic number.

It is not a de Polignac number, because 11122003729 - 27 = 11122003601 is a prime.

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

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

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

Almost surely, 211122003729 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1512, while the sum is 28.

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