Base | Representation |
---|---|
bin | 11101010011000011110… |
… | …101001101111001100011 |
3 | 21010110202102222021201002 |
4 | 131103003311031321203 |
5 | 230441300012432321 |
6 | 4140524445302215 |
7 | 265313125232246 |
oct | 35230365157143 |
9 | 7113672867632 |
10 | 2013330202211 |
11 | 706937459029 |
12 | 28624426496b |
13 | 117b19179ba3 |
14 | 6d63501125d |
15 | 3758840720b |
hex | 1d4c3d4de63 |
2013330202211 has 16 divisors (see below), whose sum is σ = 2099246972928. Its totient is φ = 1929498170400.
The previous prime is 2013330202199. The next prime is 2013330202241. The reversal of 2013330202211 is 1122020333102.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2013330202211 is a prime.
It is a super-3 number, since 3×20133302022113 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2013330202241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 935195 + ... + 2213876.
It is an arithmetic number, because the mean of its divisors is an integer number (131202935808).
Almost surely, 22013330202211 is an apocalyptic number.
2013330202211 is a deficient number, since it is larger than the sum of its proper divisors (85916770717).
2013330202211 is a wasteful number, since it uses less digits than its factorization.
2013330202211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3149402.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 2013330202211 its reverse (1122020333102), we get a palindrome (3135350535313).
The spelling of 2013330202211 in words is "two trillion, thirteen billion, three hundred thirty million, two hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.037 sec. • engine limits •