Base | Representation |
---|---|
bin | 110010010011001011001100… |
… | …000111010101000010010011 |
3 | 1002000021102111212012001200220 |
4 | 302103023030013111002103 |
5 | 212443432040031133021 |
6 | 2102255023012244123 |
7 | 64411422034404231 |
oct | 6223131407250223 |
9 | 1060242455161626 |
10 | 221220010021011 |
11 | 6453a974510421 |
12 | 20989b05910643 |
13 | 9658c5a633521 |
14 | 3c8b169b3d951 |
15 | 1a896906aacc6 |
hex | c932cc1d5093 |
221220010021011 has 8 divisors (see below), whose sum is σ = 296282704005120. Its totient is φ = 146818661358792.
The previous prime is 221220010021001. The next prime is 221220010021039. The reversal of 221220010021011 is 110120010022122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 221220010021011 - 231 = 221217862537363 is a prime.
It is a super-3 number, since 3×2212200100210113 (a number of 44 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (221220010021001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 165336329691 + ... + 165336331028.
It is an arithmetic number, because the mean of its divisors is an integer number (37035338000640).
Almost surely, 2221220010021011 is an apocalyptic number.
221220010021011 is a deficient number, since it is larger than the sum of its proper divisors (75062693984109).
221220010021011 is a wasteful number, since it uses less digits than its factorization.
221220010021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 330672660945.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 221220010021011 its reverse (110120010022122), we get a palindrome (331340020043133).
The spelling of 221220010021011 in words is "two hundred twenty-one trillion, two hundred twenty billion, ten million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •