Base | Representation |
---|---|
bin | 1001010010111101000000… |
… | …1100000010000010110011 |
3 | 1100012010202101201020200222 |
4 | 2110233100030002002303 |
5 | 2314431024310342321 |
6 | 33423321425403255 |
7 | 2103313234413155 |
oct | 224572014020263 |
9 | 40163671636628 |
10 | 10221220012211 |
11 | 329088225949a |
12 | 1190b35a9952b |
13 | 591b1a832630 |
14 | 2749d1554ad5 |
15 | 12ad262c33ab |
hex | 94bd03020b3 |
10221220012211 has 16 divisors (see below), whose sum is σ = 11043996688704. Its totient is φ = 9403708345344.
The previous prime is 10221220012189. The next prime is 10221220012217. The reversal of 10221220012211 is 11221002212201.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10221220012211 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10221220012211.
It is not an unprimeable number, because it can be changed into a prime (10221220012217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4299851 + ... + 6239483.
It is an arithmetic number, because the mean of its divisors is an integer number (690249793044).
Almost surely, 210221220012211 is an apocalyptic number.
10221220012211 is a deficient number, since it is larger than the sum of its proper divisors (822776676493).
10221220012211 is a wasteful number, since it uses less digits than its factorization.
10221220012211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1940990.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 10221220012211 its reverse (11221002212201), we get a palindrome (21442222224412).
The spelling of 10221220012211 in words is "ten trillion, two hundred twenty-one billion, two hundred twenty million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •