Base | Representation |
---|---|
bin | 10010101110101110… |
… | …100110010010010100 |
3 | 1220220120222220212120 |
4 | 102232232212102110 |
5 | 312141444221322 |
6 | 13123343215540 |
7 | 1311243254424 |
oct | 225656462224 |
9 | 56816886776 |
10 | 20111320212 |
11 | 85903525a5 |
12 | 3a932a75b0 |
13 | 1b86782b99 |
14 | d8adc2484 |
15 | 7ca909a5c |
hex | 4aeba6494 |
20111320212 has 48 divisors (see below), whose sum is σ = 49759883712. Its totient is φ = 6300152320.
The previous prime is 20111320199. The next prime is 20111320213. The reversal of 20111320212 is 21202311102.
It is a junction number, because it is equal to n+sod(n) for n = 20111320191 and 20111320200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20111320213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 67162 + ... + 211502.
It is an arithmetic number, because the mean of its divisors is an integer number (1036664244).
Almost surely, 220111320212 is an apocalyptic number.
It is an amenable number.
20111320212 is an abundant number, since it is smaller than the sum of its proper divisors (29648563500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20111320212 is a wasteful number, since it uses less digits than its factorization.
20111320212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145048 (or 145046 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 20111320212 its reverse (21202311102), we get a palindrome (41313631314).
The spelling of 20111320212 in words is "twenty billion, one hundred eleven million, three hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •