1102030111113 has 16 divisors (see below), whose sum is σ = 1516966288896. Its totient is φ = 710896389120.

The previous prime is 1102030111109. The next prime is 1102030111121. The reversal of 1102030111113 is 3111110302011.

It is not a de Polignac number, because 1102030111113 - 2² = 1102030111109 is a prime.

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

It is a Curzon number.

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

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20370 + ... + 1484747.

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

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

It is an amenable number.

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

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

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

The sum of its prime factors is 1513024.

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

Adding to 1102030111113 its reverse (3111110302011), we get a palindrome (4213140413124).

The spelling of 1102030111113 in words is "one trillion, one hundred two billion, thirty million, one hundred eleven thousand, one hundred thirteen".