10990111111111 has 32 divisors (see below), whose sum is σ = 13132900630080. Its totient is φ = 9078567321600.

The previous prime is 10990111111093. The next prime is 10990111111117. The reversal of 10990111111111 is 11111111109901.

It is a cyclic number.

It is not a de Polignac number, because 10990111111111 - 2¹⁵ = 10990111078343 is a prime.

10990111111111 is a modest number, since divided by 1111111 gives 1099011 as remainder.

It is a self number, because there is not a number n which added to its sum of digits gives 10990111111111.

It is a congruent number.

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

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

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

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

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

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

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

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

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

The sum of its prime factors is 108195.

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

It can be divided in two parts, 1099011 and 1111111, that multiplied together give a palindrome (1221123211221).

The spelling of 10990111111111 in words is "ten trillion, nine hundred ninety billion, one hundred eleven million, one hundred eleven thousand, one hundred eleven".