151101000010111 has 4 divisors (see below), whose sum is σ = 151125645424824. Its totient is φ = 151076354595400.

The previous prime is 151101000010069. The next prime is 151101000010133. The reversal of 151101000010111 is 111010000101151.

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

It is a cyclic number.

It is not a de Polignac number, because 151101000010111 - 2⁷ = 151101000009983 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12322698160 + ... + 12322710421.

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

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

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

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

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

The sum of its prime factors is 24645414712.

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

Adding to 151101000010111 its reverse (111010000101151), we get a palindrome (262111000111262).

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