101000010111111 has 12 divisors (see below), whose sum is σ = 149831846831992. Its totient is φ = 65513520071856.

The previous prime is 101000010111107. The next prime is 101000010111139. The reversal of 101000010111111 is 111111010000101.

It is not a de Polignac number, because 101000010111111 - 2² = 101000010111107 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 151651666501 + ... + 151651667166.

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

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

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

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

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

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

Adding to 101000010111111 its reverse (111111010000101), we get a palindrome (212111020111212).

It can be divided in two parts, 1010000101 and 11111, that multiplied together give a palindrome (11222111122211).

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