Base | Representation |
---|---|
bin | 11101010001110100100… |
… | …011010100101001101100 |
3 | 21010100022202011122212111 |
4 | 131101310203110221230 |
5 | 230431034012024322 |
6 | 4140144453013404 |
7 | 265235144524030 |
oct | 35216443245154 |
9 | 7110282148774 |
10 | 2012000111212 |
11 | 706314678a73 |
12 | 285b32924264 |
13 | 1179667376b0 |
14 | 6d54a4da1c0 |
15 | 3750b771177 |
hex | 1d4748d4a6c |
2012000111212 has 24 divisors (see below), whose sum is σ = 4333538701856. Its totient is φ = 795956087808.
The previous prime is 2012000111203. The next prime is 2012000111221. The reversal of 2012000111212 is 2121110002102.
It is an interprime number because it is at equal distance from previous prime (2012000111203) and next prime (2012000111221).
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 2012000111192 and 2012000111201.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2763736053 + ... + 2763736780.
Almost surely, 22012000111212 is an apocalyptic number.
It is an amenable number.
2012000111212 is an abundant number, since it is smaller than the sum of its proper divisors (2321538590644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2012000111212 is a wasteful number, since it uses less digits than its factorization.
2012000111212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5527472857 (or 5527472855 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2012000111212 its reverse (2121110002102), we get a palindrome (4133110113314).
It can be divided in two parts, 2012000 and 111212, that added together give a palindrome (2123212).
The spelling of 2012000111212 in words is "two trillion, twelve billion, one hundred eleven thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •