Base | Representation |
---|---|
bin | 110000000001100001110001… |
… | …110111011111101010011000 |
3 | 1000200211121002012222020111111 |
4 | 300001201301313133222120 |
5 | 210140441040330333422 |
6 | 2025113032420110104 |
7 | 62326335660100333 |
oct | 6001416167375230 |
9 | 1020747065866444 |
10 | 211211222121112 |
11 | 613311a3693114 |
12 | 1b832196b35334 |
13 | 90b119595a745 |
14 | 3a2296b84b61a |
15 | 196414ded5a77 |
hex | c01871ddfa98 |
211211222121112 has 32 divisors (see below), whose sum is σ = 419350001990400. Its totient is φ = 99385550631424.
The previous prime is 211211222121079. The next prime is 211211222121139. The reversal of 211211222121112 is 211121222112112.
It is a super-2 number, since 2×2112112221211122 (a number of 29 digits) contains 22 as substring.
It is a nude number because it is divisible by every one of its digits.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60528343 + ... + 63922630.
It is an arithmetic number, because the mean of its divisors is an integer number (13104687562200).
Almost surely, 2211211222121112 is an apocalyptic number.
It is an amenable number.
211211222121112 is a deficient number, since it is larger than the sum of its proper divisors (208138779869288).
211211222121112 is a wasteful number, since it uses less digits than its factorization.
211211222121112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124463475 (or 124463471 counting only the distinct ones).
The product of its digits is 128, while the sum is 22.
Adding to 211211222121112 its reverse (211121222112112), we get a palindrome (422332444233224).
The spelling of 211211222121112 in words is "two hundred eleven trillion, two hundred eleven billion, two hundred twenty-two million, one hundred twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •