1000101151111 has 2 divisors, whose sum is σ = 1000101151112. Its totient is φ = 1000101151110.

The previous prime is 1000101151103. The next prime is 1000101151121. The reversal of 1000101151111 is 1111511010001.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 1000101151111 - 2³ = 1000101151103 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 1000101151091 and 1000101151100.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1000101151121) by changing a digit.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500050575555 + 500050575556.

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

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

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

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

1000101151111 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 1000101151111 its reverse (1111511010001), we get a palindrome (2111612161112).

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