Base | Representation |
---|---|
bin | 1001001011111011010100… |
… | …00101011101111010001011 |
3 | 2122112012100012010212210211 |
4 | 10211331222011131322023 |
5 | 10121433132304324321 |
6 | 110544114421421551 |
7 | 4153321612310302 |
oct | 445755205357213 |
9 | 78465305125724 |
10 | 20201011011211 |
11 | 6489223092998 |
12 | 232311186a8b7 |
13 | b36c40bc6ca4 |
14 | 4dba3c715439 |
15 | 25071be640e1 |
hex | 125f6a15de8b |
20201011011211 has 16 divisors (see below), whose sum is σ = 20537969565600. Its totient is φ = 19865105694720.
The previous prime is 20201011011187. The next prime is 20201011011227. The reversal of 20201011011211 is 11211011010202.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 20201011011211 - 217 = 20201010880139 is a prime.
It is a super-4 number, since 4×202010110112114 (a number of 54 digits) contains 4444 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20201011011191 and 20201011011200.
It is not an unprimeable number, because it can be changed into a prime (20201011011611) 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, 276928735 + ... + 277001671.
It is an arithmetic number, because the mean of its divisors is an integer number (1283623097850).
Almost surely, 220201011011211 is an apocalyptic number.
20201011011211 is a deficient number, since it is larger than the sum of its proper divisors (336958554389).
20201011011211 is an equidigital number, since it uses as much as digits as its factorization.
20201011011211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80094.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20201011011211 its reverse (11211011010202), we get a palindrome (31412022021413).
The spelling of 20201011011211 in words is "twenty trillion, two hundred one billion, eleven million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •