101111000001111 has 40 divisors (see below), whose sum is σ = 154696640402304. Its totient is φ = 65779370410320.

The previous prime is 101111000001101. The next prime is 101111000001119. The reversal of 101111000001111 is 111100000111101.

It is not a de Polignac number, because 101111000001111 - 2¹¹ = 101110999999063 is a prime.

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

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 9504291 + ... + 17104196.

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

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

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

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

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

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

Adding to 101111000001111 its reverse (111100000111101), we get a palindrome (212211000112212).

The spelling of 101111000001111 in words is "one hundred one trillion, one hundred eleven billion, one thousand, one hundred eleven".