Base | Representation |
---|---|
bin | 110000000001011001011000… |
… | …000110111010010000101011 |
3 | 1000200210201210110022000110212 |
4 | 300001121120012322100223 |
5 | 210140314101201120021 |
6 | 2025104541245131335 |
7 | 62325566255356514 |
oct | 6001313006722053 |
9 | 1020721713260425 |
10 | 211202200020011 |
11 | 61328393977012 |
12 | 1b830499559b4b |
13 | 90b038873c895 |
14 | 3a22353521a0b |
15 | 1963cc1de085b |
hex | c016581ba42b |
211202200020011 has 4 divisors (see below), whose sum is σ = 215695863850272. Its totient is φ = 206708536189752.
The previous prime is 211202200019981. The next prime is 211202200020029. The reversal of 211202200020011 is 110020002202112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 211202200020011 - 234 = 211185020150827 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211202200020811) 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 in 3 ways as a sum of consecutive naturals, for example, 2246831915060 + ... + 2246831915153.
It is an arithmetic number, because the mean of its divisors is an integer number (53923965962568).
Almost surely, 2211202200020011 is an apocalyptic number.
211202200020011 is a deficient number, since it is larger than the sum of its proper divisors (4493663830261).
211202200020011 is an equidigital number, since it uses as much as digits as its factorization.
211202200020011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4493663830260.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 211202200020011 its reverse (110020002202112), we get a palindrome (321222202222123).
The spelling of 211202200020011 in words is "two hundred eleven trillion, two hundred two billion, two hundred million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •