Base | Representation |
---|---|
bin | 10010101110101101… |
… | …011000011000111111 |
3 | 1220220120101201012111 |
4 | 102232231120120333 |
5 | 312141404014101 |
6 | 13123332314451 |
7 | 1311240455263 |
oct | 225655303077 |
9 | 56816351174 |
10 | 20111001151 |
11 | 859015490a |
12 | 3a93172a27 |
13 | 1b866a08a7 |
14 | d8ad3c0a3 |
15 | 7ca895251 |
hex | 4aeb5863f |
20111001151 has 2 divisors, whose sum is σ = 20111001152. Its totient is φ = 20111001150.
The previous prime is 20111001137. The next prime is 20111001161. The reversal of 20111001151 is 15110011102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20111001151 - 27 = 20111001023 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20111001121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10055500575 + 10055500576.
It is an arithmetic number, because the mean of its divisors is an integer number (10055500576).
Almost surely, 220111001151 is an apocalyptic number.
20111001151 is a deficient number, since it is larger than the sum of its proper divisors (1).
20111001151 is an equidigital number, since it uses as much as digits as its factorization.
20111001151 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 13.
Adding to 20111001151 its reverse (15110011102), we get a palindrome (35221012253).
The spelling of 20111001151 in words is "twenty billion, one hundred eleven million, one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •