Base | Representation |
---|---|
bin | 101101100001011101000010… |
… | …001100010000001000101000 |
3 | 222020212222121121002001201012 |
4 | 231201131002030100020220 |
5 | 202220224122304323422 |
6 | 1545451400235443052 |
7 | 60112524331314653 |
oct | 5541350214201050 |
9 | 866788547061635 |
10 | 200211011011112 |
11 | 58880016253132 |
12 | 1a55629a5b6488 |
13 | 8793a8188c53a |
14 | 376239c24089a |
15 | 1822e3402a4e2 |
hex | b61742310228 |
200211011011112 has 16 divisors (see below), whose sum is σ = 375395799138900. Its totient is φ = 100105464574080.
The previous prime is 200211011011009. The next prime is 200211011011153. The reversal of 200211011011112 is 211110110112002.
It can be written as a sum of positive squares in 2 ways, for example, as 183310640679076 + 16900370332036 = 13539226^2 + 4111006^2 .
It is a super-2 number, since 2×2002110110111122 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 29251964 + ... + 35441492.
Almost surely, 2200211011011112 is an apocalyptic number.
It is an amenable number.
200211011011112 is a deficient number, since it is larger than the sum of its proper divisors (175184788127788).
200211011011112 is a wasteful number, since it uses less digits than its factorization.
200211011011112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10232876 (or 10232872 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 200211011011112 its reverse (211110110112002), we get a palindrome (411321121123114).
The spelling of 200211011011112 in words is "two hundred trillion, two hundred eleven billion, eleven million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •