150102011 has 2 divisors, whose sum is σ = 150102012. Its totient is φ = 150102010.

The previous prime is 150101981. The next prime is 150102013. The reversal of 150102011 is 110201051.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 150102011 - 2⁶ = 150101947 is a prime.

It is a super-2 number, since 2×150102011² = 45061227412488242, which contains 22 as substring.

Together with 150102013, it forms a pair of twin primes.

It is a Chen prime.

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

It is not a weakly prime, because it can be changed into another prime (150102013) 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, 75051005 + 75051006.

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

Almost surely, 2^150102011 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 10, while the sum is 11.

The square root of 150102011 is about 12251.6125877372. The cubic root of 150102011 is about 531.4497049231.

Adding to 150102011 its reverse (110201051), we get a palindrome (260303062).

The spelling of 150102011 in words is "one hundred fifty million, one hundred two thousand, eleven".