101111111001151 has 2 divisors, whose sum is σ = 101111111001152. Its totient is φ = 101111111001150.

The previous prime is 101111111001113. The next prime is 101111111001169. The reversal of 101111111001151 is 151100111111101.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 101111111001151 - 2⁷ = 101111111001023 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (101111111002151) 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 as a sum of consecutive naturals, namely, 50555555500575 + 50555555500576.

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

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

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

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

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

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

Adding to 101111111001151 its reverse (151100111111101), we get a palindrome (252211222112252).

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