110505050005 has 32 divisors (see below), whose sum is σ = 153763591680. Its totient is φ = 74669091840.

The previous prime is 110505049981. The next prime is 110505050009. The reversal of 110505050005 is 500050505011.

It is not a de Polignac number, because 110505050005 - 2⁷ = 110505049877 is a prime.

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5300041 + ... + 5320849.

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

Almost surely, 2^110505050005 is an apocalyptic number.

It is an amenable number.

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

110505050005 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 23029.

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

Adding to 110505050005 its reverse (500050505011), we get a palindrome (610555555016).

The spelling of 110505050005 in words is "one hundred ten billion, five hundred five million, fifty thousand, five".