Base | Representation |
---|---|
bin | 110000000000001101110110… |
… | …001011010001001001110011 |
3 | 1000200111222110110111020011112 |
4 | 300000031312023101021303 |
5 | 210133002003111201321 |
6 | 2025003410000303535 |
7 | 62316665446414610 |
oct | 6000156613211163 |
9 | 1020458413436145 |
10 | 211121100100211 |
11 | 612a6a570aaa04 |
12 | 1b818825311bab |
13 | 90a5832784762 |
14 | 3a1c45c669507 |
15 | 1961b270a4a5b |
hex | c003762d1273 |
211121100100211 has 4 divisors (see below), whose sum is σ = 241281257257392. Its totient is φ = 180960942943032.
The previous prime is 211121100100091. The next prime is 211121100100283. The reversal of 211121100100211 is 112001001121112.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 211121100100211 - 210 = 211121100099187 is a prime.
It is a super-2 number, since 2×2111211001002112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211121100100811) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15080078578580 + ... + 15080078578593.
It is an arithmetic number, because the mean of its divisors is an integer number (60320314314348).
Almost surely, 2211121100100211 is an apocalyptic number.
211121100100211 is a deficient number, since it is larger than the sum of its proper divisors (30160157157181).
211121100100211 is an equidigital number, since it uses as much as digits as its factorization.
211121100100211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30160157157180.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 211121100100211 its reverse (112001001121112), we get a palindrome (323122101221323).
The spelling of 211121100100211 in words is "two hundred eleven trillion, one hundred twenty-one billion, one hundred million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •