Base | Representation |
---|---|
bin | 101111111110100110100100… |
… | …001000101000100101101100 |
3 | 1000200010101012210011122101120 |
4 | 233332212210020220211230 |
5 | 210124142343203341022 |
6 | 2024440425405340540 |
7 | 62305661341260324 |
oct | 5776464410504554 |
9 | 1020111183148346 |
10 | 211010202012012 |
11 | 61263a19013947 |
12 | 1b7bb235867750 |
13 | 909823b1b0420 |
14 | 3a16d3c0a6284 |
15 | 195dcd620bd5c |
hex | bfe9a422896c |
211010202012012 has 72 divisors (see below), whose sum is σ = 563255517619536. Its totient is φ = 61107026813952.
The previous prime is 211010202011969. The next prime is 211010202012031. The reversal of 211010202012012 is 210210202010112.
211010202012012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2110102020120122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 211010202011982 and 211010202012000.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2340144363 + ... + 2340234530.
Almost surely, 2211010202012012 is an apocalyptic number.
It is an amenable number.
211010202012012 is an abundant number, since it is smaller than the sum of its proper divisors (352245315607524).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211010202012012 is a wasteful number, since it uses less digits than its factorization.
211010202012012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4680378947 (or 4680378928 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 211010202012012 its reverse (210210202010112), we get a palindrome (421220404022124).
The spelling of 211010202012012 in words is "two hundred eleven trillion, ten billion, two hundred two million, twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •