Base | Representation |
---|---|
bin | 110000001101001010101110… |
… | …111001101000110010011100 |
3 | 1000210200001201210011010222011 |
4 | 300031022232321220302130 |
5 | 210242042223130310022 |
6 | 2030524320453401004 |
7 | 62441203643006005 |
oct | 6015125671506234 |
9 | 1023601653133864 |
10 | 212011110010012 |
11 | 6160a452534105 |
12 | 1b94120b939164 |
13 | 913b73c612b91 |
14 | 3a4d56cd4c1ac |
15 | 1979d6752e977 |
hex | c0d2aee68c9c |
212011110010012 has 24 divisors (see below), whose sum is σ = 377237799711360. Its totient is φ = 104236760340720.
The previous prime is 212011110009973. The next prime is 212011110010013. The reversal of 212011110010012 is 210010011110212.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 212011110009974 and 212011110010001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212011110010013) 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, 984744598 + ... + 984959869.
It is an arithmetic number, because the mean of its divisors is an integer number (15718241654640).
Almost surely, 2212011110010012 is an apocalyptic number.
It is an amenable number.
212011110010012 is a deficient number, since it is larger than the sum of its proper divisors (165226689701348).
212011110010012 is a wasteful number, since it uses less digits than its factorization.
212011110010012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1969704921 (or 1969704919 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 212011110010012 its reverse (210010011110212), we get a palindrome (422021121120224).
The spelling of 212011110010012 in words is "two hundred twelve trillion, eleven billion, one hundred ten million, ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •