Search a number
-
+
11010211151 is a prime number
BaseRepresentation
bin10100100000100001…
…00111110101001111
31001102022122200022012
422100100213311033
5140022103224101
65020311011435
7536562151652
oct122020476517
931368580265
1011010211151
11473aa82665
122173369b7b
131066091354
147663ab899
15446909bbb
hex290427d4f

11010211151 has 2 divisors, whose sum is σ = 11010211152. Its totient is φ = 11010211150.

The previous prime is 11010211139. The next prime is 11010211153. The reversal of 11010211151 is 15111201011.

It is a strong prime.

It is a cyclic number.

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

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

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 211010211151 is an apocalyptic number.

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

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

11010211151 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 14.

Adding to 11010211151 its reverse (15111201011), we get a palindrome (26121412162).

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