1111001100151 has 2 divisors, whose sum is σ = 1111001100152. Its totient is φ = 1111001100150.

The previous prime is 1111001100107. The next prime is 1111001100161. The reversal of 1111001100151 is 1510011001111.

It is a strong prime.

It is a cyclic number.

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

It is a congruent number.

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

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

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

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

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

1111001100151 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 13.

Adding to 1111001100151 its reverse (1510011001111), we get a palindrome (2621012101262).

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