110060505029 has 2 divisors, whose sum is σ = 110060505030. Its totient is φ = 110060505028.

The previous prime is 110060505013. The next prime is 110060505077. The reversal of 110060505029 is 920505060011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 106788436225 + 3272068804 = 326785^2 + 57202^2 .

It is a cyclic number.

It is not a de Polignac number, because 110060505029 - 2⁴ = 110060505013 is a prime.

It is a super-2 number, since 2×110060505029² (a number of 23 digits) contains 22 as substring.

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 = 110060504992 and 110060505010.

It is a congruent number.

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

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

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

Almost surely, 2^110060505029 is an apocalyptic number.

It is an amenable number.

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

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

110060505029 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 2700, while the sum is 29.

The spelling of 110060505029 in words is "one hundred ten billion, sixty million, five hundred five thousand, twenty-nine".