Base | Representation |
---|---|
bin | 110000000000001101110000… |
… | …111000001101111000100011 |
3 | 1000200111222020021020122102222 |
4 | 300000031300320031320203 |
5 | 210133001312333020003 |
6 | 2025003353103301255 |
7 | 62316663320064623 |
oct | 6000156070157043 |
9 | 1020458207218388 |
10 | 211121011220003 |
11 | 612a6a10a13995 |
12 | 1b8187bb5aa82b |
13 | 90a581a235411 |
14 | 3a1c450930883 |
15 | 1961b1e399c38 |
hex | c00370e0de23 |
211121011220003 has 2 divisors, whose sum is σ = 211121011220004. Its totient is φ = 211121011220002.
The previous prime is 211121011219939. The next prime is 211121011220017. The reversal of 211121011220003 is 300022110121112.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 211121011220003 - 26 = 211121011219939 is a prime.
It is a super-2 number, since 2×2111210112200032 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (211121011220023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105560505610001 + 105560505610002.
It is an arithmetic number, because the mean of its divisors is an integer number (105560505610002).
Almost surely, 2211121011220003 is an apocalyptic number.
211121011220003 is a deficient number, since it is larger than the sum of its proper divisors (1).
211121011220003 is an equidigital number, since it uses as much as digits as its factorization.
211121011220003 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 211121011220003 its reverse (300022110121112), we get a palindrome (511143121341115).
The spelling of 211121011220003 in words is "two hundred eleven trillion, one hundred twenty-one billion, eleven million, two hundred twenty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •