Base | Representation |
---|---|
bin | 1100010010110010010… |
… | …0010101111011011100 |
3 | 202012010222011122021020 |
4 | 3010230210111323130 |
5 | 11430014441401022 |
6 | 241005141004140 |
7 | 21154521626256 |
oct | 3045444257334 |
9 | 665128148236 |
10 | 211201122012 |
11 | 8162a588a31 |
12 | 34b229b3650 |
13 | 16bbab0471a |
14 | a317986cd6 |
15 | 57619e035c |
hex | 312c915edc |
211201122012 has 24 divisors (see below), whose sum is σ = 492834994176. Its totient is φ = 70395748848.
The previous prime is 211201122007. The next prime is 211201122037. The reversal of 211201122012 is 210221102112.
211201122012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 211201121982 and 211201122000.
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 in 7 ways as a sum of consecutive naturals, for example, 385308 + ... + 755555.
It is an arithmetic number, because the mean of its divisors is an integer number (20534791424).
Almost surely, 2211201122012 is an apocalyptic number.
It is an amenable number.
211201122012 is an abundant number, since it is smaller than the sum of its proper divisors (281633872164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211201122012 is a wasteful number, since it uses less digits than its factorization.
211201122012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1156297 (or 1156295 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 211201122012 its reverse (210221102112), we get a palindrome (421422224124).
The spelling of 211201122012 in words is "two hundred eleven billion, two hundred one million, one hundred twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •