Search a number
-
+
11001014329 is a prime number
BaseRepresentation
bin10100011111011011…
…00010100000111001
31001101200100102122011
422033231202200321
5140012224424304
65015341525521
7536421036034
oct121755424071
931350312564
1011001014329
114735870988
1221702738a1
1310641c1246
1476509601b
15445bdec04
hex28fb62839

11001014329 has 2 divisors, whose sum is σ = 11001014330. Its totient is φ = 11001014328.

The previous prime is 11001014293. The next prime is 11001014363. The reversal of 11001014329 is 92341010011.

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

Together with previous prime (11001014293) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7280014329 + 3721000000 = 85323^2 + 61000^2 .

It is a cyclic number.

It is not a de Polignac number, because 11001014329 - 225 = 10967459897 is a prime.

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

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

Almost surely, 211001014329 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 216, while the sum is 22.

The spelling of 11001014329 in words is "eleven billion, one million, fourteen thousand, three hundred twenty-nine".