10152011 has 2 divisors, whose sum is σ = 10152012. Its totient is φ = 10152010.

The previous prime is 10151987. The next prime is 10152013. The reversal of 10152011 is 11025101.

10152011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

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

It is a Sophie Germain prime.

Together with 10152013, 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 = 10151983 and 10152001.

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

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

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

Almost surely, 2^10152011 is an apocalyptic number.

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

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

10152011 is an evil number, because the sum of its binary digits is even.

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

The square root of 10152011 is about 3186.2220575472. Note that the first 3 decimals coincide. The cubic root of 10152011 is about 216.5296430137.

Adding to 10152011 its reverse (11025101), we get a palindrome (21177112).

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