101100101001111 has 48 divisors (see below), whose sum is σ = 151146257633280. Its totient is φ = 65052007416000.

The previous prime is 101100101001091. The next prime is 101100101001127. The reversal of 101100101001111 is 111100101001101.

It is not a de Polignac number, because 101100101001111 - 2²⁷ = 101099966783383 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 = 101100101001093 and 101100101001102.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (101100101001611) 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 47 ways as a sum of consecutive naturals, for example, 424348441 + ... + 424586621.

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

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

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

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

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

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

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

Adding to 101100101001111 its reverse (111100101001101), we get a palindrome (212200202002212).

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