Base | Representation |
---|---|
bin | 101101101110100100010110… |
… | …100000010101011000000000 |
3 | 222101002010210111001121212201 |
4 | 231232210112200111120000 |
5 | 202330010312112210422 |
6 | 1551421402354002544 |
7 | 60234610215522322 |
oct | 5556442640253000 |
9 | 871063714047781 |
10 | 201112221210112 |
11 | 59098239985393 |
12 | 1a680a8bb76454 |
13 | 882aa54ca1114 |
14 | 3793c5224d612 |
15 | 183b5cc909727 |
hex | b6e916815600 |
201112221210112 has 20 divisors (see below), whose sum is σ = 401831645114196. Its totient is φ = 100556110604800.
The previous prime is 201112221210059. The next prime is 201112221210139. The reversal of 201112221210112 is 211012122211102.
It is a happy number.
It is a super-3 number, since 3×2011122212101123 (a number of 44 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 201112221210112.
It is a congruent number.
It is an unprimeable number.
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, 196398653014 + ... + 196398654037.
Almost surely, 2201112221210112 is an apocalyptic number.
It is an amenable number.
201112221210112 is a deficient number, since it is larger than the sum of its proper divisors (200719423904084).
201112221210112 is an frugal number, since it uses more digits than its factorization.
201112221210112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 392797307069 (or 392797307053 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 201112221210112 its reverse (211012122211102), we get a palindrome (412124343421214).
The spelling of 201112221210112 in words is "two hundred one trillion, one hundred twelve billion, two hundred twenty-one million, two hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •