Base | Representation |
---|---|
bin | 10100100000100001… |
… | …00111110101001111 |
3 | 1001102022122200022012 |
4 | 22100100213311033 |
5 | 140022103224101 |
6 | 5020311011435 |
7 | 536562151652 |
oct | 122020476517 |
9 | 31368580265 |
10 | 11010211151 |
11 | 473aa82665 |
12 | 2173369b7b |
13 | 1066091354 |
14 | 7663ab899 |
15 | 446909bbb |
hex | 290427d4f |
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".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •