Base | Representation |
---|---|
bin | 110000000000001101110000… |
… | …111000001001010000000011 |
3 | 1000200111222020021012200102011 |
4 | 300000031300320021100003 |
5 | 210133001312331413102 |
6 | 2025003353103033351 |
7 | 62316663316655404 |
oct | 6000156070112003 |
9 | 1020458207180364 |
10 | 211121011201027 |
11 | 612a6a10a00704 |
12 | 1b8187bb59b857 |
13 | 90a581a2298a5 |
14 | 3a1c4509279ab |
15 | 1961b1e3942d7 |
hex | c00370e09403 |
211121011201027 has 2 divisors, whose sum is σ = 211121011201028. Its totient is φ = 211121011201026.
The previous prime is 211121011201013. The next prime is 211121011201033. The reversal of 211121011201027 is 720102110121112.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-211121011201027 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 211121011200989 and 211121011201007.
It is not a weakly prime, because it can be changed into another prime (211121011201097) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105560505600513 + 105560505600514.
It is an arithmetic number, because the mean of its divisors is an integer number (105560505600514).
Almost surely, 2211121011201027 is an apocalyptic number.
211121011201027 is a deficient number, since it is larger than the sum of its proper divisors (1).
211121011201027 is an equidigital number, since it uses as much as digits as its factorization.
211121011201027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 22.
Adding to 211121011201027 its reverse (720102110121112), we get a palindrome (931223121322139).
The spelling of 211121011201027 in words is "two hundred eleven trillion, one hundred twenty-one billion, eleven million, two hundred one thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •