Base | Representation |
---|---|
bin | 101111111110101111111000… |
… | …101010110110010110011011 |
3 | 1000200011100001021100101002020 |
4 | 233332233320222312112123 |
5 | 210124323342302431021 |
6 | 2024445202443505523 |
7 | 62306464345422660 |
oct | 5776577052662633 |
9 | 1020140037311066 |
10 | 211020210202011 |
11 | 61268194412151 |
12 | 1b8011695282a3 |
13 | 90991747a7642 |
14 | 3a1760b35ba67 |
15 | 195e1beb867c6 |
hex | bfebf8ab659b |
211020210202011 has 16 divisors (see below), whose sum is σ = 329397401292288. Its totient is φ = 117641929032000.
The previous prime is 211020210201917. The next prime is 211020210202019. The reversal of 211020210202011 is 110202012020112.
It is not a de Polignac number, because 211020210202011 - 229 = 211019673331099 is a prime.
It is a super-2 number, since 2×2110202102020112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (211020210202019) 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, 122543675215 + ... + 122543676936.
It is an arithmetic number, because the mean of its divisors is an integer number (20587337580768).
Almost surely, 2211020210202011 is an apocalyptic number.
211020210202011 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
211020210202011 is a deficient number, since it is larger than the sum of its proper divisors (118377191090277).
211020210202011 is a wasteful number, since it uses less digits than its factorization.
211020210202011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 245087352202.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 211020210202011 its reverse (110202012020112), we get a palindrome (321222222222123).
The spelling of 211020210202011 in words is "two hundred eleven trillion, twenty billion, two hundred ten million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •