Base | Representation |
---|---|
bin | 10010101111010011… |
… | …111001111110110011 |
3 | 1220221021101210111202 |
4 | 102233103321332303 |
5 | 312202000201321 |
6 | 13124333001415 |
7 | 1311422346512 |
oct | 225723717663 |
9 | 56837353452 |
10 | 20121100211 |
11 | 8595922443 |
12 | 3a9662326b |
13 | 1b887c8574 |
14 | d8c40a679 |
15 | 7cb6dc70b |
hex | 4af4f9fb3 |
20121100211 has 2 divisors, whose sum is σ = 20121100212. Its totient is φ = 20121100210.
The previous prime is 20121100177. The next prime is 20121100213. The reversal of 20121100211 is 11200112102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20121100211 - 230 = 19047358387 is a prime.
It is a super-2 number, since 2×201211002112 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 20121100213, 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 = 20121100192 and 20121100201.
It is not a weakly prime, because it can be changed into another prime (20121100213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10060550105 + 10060550106.
It is an arithmetic number, because the mean of its divisors is an integer number (10060550106).
Almost surely, 220121100211 is an apocalyptic number.
20121100211 is a deficient number, since it is larger than the sum of its proper divisors (1).
20121100211 is an equidigital number, since it uses as much as digits as its factorization.
20121100211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 20121100211 its reverse (11200112102), we get a palindrome (31321212313).
The spelling of 20121100211 in words is "twenty billion, one hundred twenty-one million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •