101151111101111 has 4 divisors (see below), whose sum is σ = 101151847134552. Its totient is φ = 101150375067672.

The previous prime is 101151111101099. The next prime is 101151111101141. The reversal of 101151111101111 is 111101111151101.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-101151111101111 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

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

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

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

101151111101111 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 736033440.

The product of its (nonzero) digits is 5, while the sum is 17.

Adding to 101151111101111 its reverse (111101111151101), we get a palindrome (212252222252212).

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