110213200101029 has 2 divisors, whose sum is σ = 110213200101030. Its totient is φ = 110213200101028.

The previous prime is 110213200100977. The next prime is 110213200101077. The reversal of 110213200101029 is 920101002312011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 75349170552100 + 34864029548929 = 8680390^2 + 5904577^2 .

It is a cyclic number.

It is not a de Polignac number, because 110213200101029 - 2¹² = 110213200096933 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

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

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

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

Almost surely, 2^{110213200101029} is an apocalyptic number.

It is an amenable number.

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

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

110213200101029 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 23.

The spelling of 110213200101029 in words is "one hundred ten trillion, two hundred thirteen billion, two hundred million, one hundred one thousand, twenty-nine".