11102002111123 has 24 divisors (see below), whose sum is σ = 13948126556000. Its totient is φ = 8649788083200.

The previous prime is 11102002111117. The next prime is 11102002111127. The reversal of 11102002111123 is 32111120020111.

It is a happy number.

It is not a de Polignac number, because 11102002111123 - 2²⁹ = 11101465240211 is a prime.

It is a super-3 number, since 3×11102002111123³ (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

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

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5710003 + ... + 7403251.

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

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

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

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

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

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

Adding to 11102002111123 its reverse (32111120020111), we get a palindrome (43213122131234).

The spelling of 11102002111123 in words is "eleven trillion, one hundred two billion, two million, one hundred eleven thousand, one hundred twenty-three".