1010100111111 has 144 divisors (see below), whose sum is σ = 1857237118464. Its totient is φ = 515126469888.

The previous prime is 1010100111107. The next prime is 1010100111133. The reversal of 1010100111111 is 1111110010101.

1010100111111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 1010100111111 - 2² = 1010100111107 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

1010100111111 is a modest number, since divided by 111111 gives 10101 as remainder.

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

It is a congruent number.

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

It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 182754630 + ... + 182760156.

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

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

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

1010100111111 is an evil number, because the sum of its binary digits is even.

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

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

Adding to 1010100111111 its reverse (1111110010101), we get a palindrome (2121210121212).

It can be divided in two parts, 1010100 and 111111, that added together give a palindrome (1121211).

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