Base | Representation |
---|---|
bin | 101101110000000001011001… |
… | …000011111111010101111000 |
3 | 222101102200122202012201010201 |
4 | 231300001121003333111320 |
5 | 202333124411224213422 |
6 | 1551535323420451544 |
7 | 60245044650216313 |
oct | 5560013103772570 |
9 | 871380582181121 |
10 | 201212122101112 |
11 | 59126644378421 |
12 | 1a6983106a9bb4 |
13 | 88372b60bc785 |
14 | 3798a0c07197a |
15 | 183dec80b8727 |
hex | b700590ff578 |
201212122101112 has 64 divisors (see below), whose sum is σ = 381213803430720. Its totient is φ = 99559789314048.
The previous prime is 201212122101083. The next prime is 201212122101131. The reversal of 201212122101112 is 211101221212102.
It is a happy number.
201212122101112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 201212122101112.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2573236288 + ... + 2573314480.
It is an arithmetic number, because the mean of its divisors is an integer number (5956465678605).
Almost surely, 2201212122101112 is an apocalyptic number.
It is an amenable number.
201212122101112 is a deficient number, since it is larger than the sum of its proper divisors (180001681329608).
201212122101112 is a wasteful number, since it uses less digits than its factorization.
201212122101112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 85640 (or 85636 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 201212122101112 its reverse (211101221212102), we get a palindrome (412313343313214).
The spelling of 201212122101112 in words is "two hundred one trillion, two hundred twelve billion, one hundred twenty-two million, one hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •