100010010111111 has 12 divisors (see below), whose sum is σ = 144547692023592. Its totient is φ = 66632360752656.

The previous prime is 100010010111079. The next prime is 100010010111127. The reversal of 100010010111111 is 111111010010001.

It is not a de Polignac number, because 100010010111111 - 2⁵ = 100010010111079 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 = 100010010111093 and 100010010111102.

It is a congruent number.

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

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

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

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

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

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

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

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

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

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

Adding to 100010010111111 its reverse (111111010010001), we get a palindrome (211121020121112).

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