11014271029 has 2 divisors, whose sum is σ = 11014271030. Its totient is φ = 11014271028.

The previous prime is 11014270921. The next prime is 11014271033. The reversal of 11014271029 is 92017241011.

Together with previous prime (11014270921) 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., 10070122500 + 944148529 = 100350^2 + 30727^2 .

It is a cyclic number.

It is not a de Polignac number, because 11014271029 - 2¹⁹ = 11013746741 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (11014271039) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5507135514 + 5507135515.

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

Almost surely, 2^11014271029 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 11014271029 in words is "eleven billion, fourteen million, two hundred seventy-one thousand, twenty-nine".