110121021120121 has 24 divisors (see below), whose sum is σ = 131736018739104. Its totient is φ = 90972187703040.

The previous prime is 110121021120107. The next prime is 110121021120127. The reversal of 110121021120121 is 121021120121011.

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

It is a super-2 number, since 2×110121021120121² (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 = 110121021120095 and 110121021120104.

It is not an unprimeable number, because it can be changed into a prime (110121021120127) 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 23 ways as a sum of consecutive naturals, for example, 349951215 + ... + 350265748.

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

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

110121021120121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 700217049 (or 700217020 counting only the distinct ones).

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

Adding to 110121021120121 its reverse (121021120121011), we get a palindrome (231142141241132).

The spelling of 110121021120121 in words is "one hundred ten trillion, one hundred twenty-one billion, twenty-one million, one hundred twenty thousand, one hundred twenty-one".