Base | Representation |
---|---|
bin | 110000001111111100101101… |
… | …011010001000110101010000 |
3 | 1000211100022222221102022021001 |
4 | 300033330231122020311100 |
5 | 210303210112010120422 |
6 | 2031152203331311344 |
7 | 62461050415542025 |
oct | 6017745532106520 |
9 | 1024308887368231 |
10 | 212202211020112 |
11 | 616834a80254a5 |
12 | 1b97226314b554 |
13 | 915377608a251 |
14 | 3a588db1cd54c |
15 | 197ecee5cb227 |
hex | c0ff2d688d50 |
212202211020112 has 40 divisors (see below), whose sum is σ = 424489121568512. Its totient is φ = 102657997382400.
The previous prime is 212202211020073. The next prime is 212202211020119. The reversal of 212202211020112 is 211020112202212.
It is a self number, because there is not a number n which added to its sum of digits gives 212202211020112.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212202211020119) by changing a digit.
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, 40203333 + ... + 45174244.
Almost surely, 2212202211020112 is an apocalyptic number.
It is an amenable number.
212202211020112 is an abundant number, since it is smaller than the sum of its proper divisors (212286910548400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212202211020112 is a wasteful number, since it uses less digits than its factorization.
212202211020112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85382627 (or 85382621 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 212202211020112 its reverse (211020112202212), we get a palindrome (423222323222324).
The spelling of 212202211020112 in words is "two hundred twelve trillion, two hundred two billion, two hundred eleven million, twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •