110060505611051 has 4 divisors (see below), whose sum is σ = 110090099727600. Its totient is φ = 110030911494504.

The previous prime is 110060505610927. The next prime is 110060505611149. The reversal of 110060505611051 is 150116505060011.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-110060505611051 is a prime.

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

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (110060505614051) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14797052696 + ... + 14797060133.

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

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

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

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

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

The sum of its prime factors is 29594116548.

The product of its (nonzero) digits is 4500, while the sum is 32.

The spelling of 110060505611051 in words is "one hundred ten trillion, sixty billion, five hundred five million, six hundred eleven thousand, fifty-one".