Base | Representation |
---|---|
bin | 1001001001000010111010… |
… | …01110110110110101110011 |
3 | 2122011201210201101101021211 |
4 | 10210201131032312311303 |
5 | 10113322404321333021 |
6 | 110430423022300551 |
7 | 4143215401160641 |
oct | 444413516666563 |
9 | 78151721341254 |
10 | 20102011121011 |
11 | 6450240246116 |
12 | 2307aa2a27757 |
13 | b2a7c46626c1 |
14 | 4d6d2a430191 |
15 | 24cd7592d3e1 |
hex | 12485d3b6d73 |
20102011121011 has 16 divisors (see below), whose sum is σ = 20666212570080. Its totient is φ = 19541336820480.
The previous prime is 20102011120999. The next prime is 20102011121053. The reversal of 20102011121011 is 11012111020102.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 20102011121011 - 223 = 20102002732403 is a prime.
It is a super-2 number, since 2×201020111210112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20102011120982 and 20102011121000.
It is not an unprimeable number, because it can be changed into a prime (20102011121711) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 279979305 + ... + 280051093.
It is an arithmetic number, because the mean of its divisors is an integer number (1291638285630).
Almost surely, 220102011121011 is an apocalyptic number.
20102011121011 is a deficient number, since it is larger than the sum of its proper divisors (564201449069).
20102011121011 is a wasteful number, since it uses less digits than its factorization.
20102011121011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 96246.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20102011121011 its reverse (11012111020102), we get a palindrome (31114122141113).
The spelling of 20102011121011 in words is "twenty trillion, one hundred two billion, eleven million, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •