101000000001111 has 32 divisors (see below), whose sum is σ = 136532868019200. Its totient is φ = 66405556060800.

The previous prime is 101000000001107. The next prime is 101000000001127. The reversal of 101000000001111 is 111100000000101.

It is not a de Polignac number, because 101000000001111 - 2² = 101000000001107 is a prime.

101000000001111 is a modest number, since divided by 1111 gives 101 as remainder.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (101000000001181) 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, 416134930 + ... + 416377568.

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

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

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

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

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

The sum of its prime factors is 248119.

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

Adding to 101000000001111 its reverse (111100000000101), we get a palindrome (212100000001212).

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