Base | Representation |
---|---|
bin | 1001010010111101000000… |
… | …1100110000001011111011 |
3 | 1100012010202102001211221222 |
4 | 2110233100030300023323 |
5 | 2314431024332414321 |
6 | 33423321433422255 |
7 | 2103313236131165 |
oct | 224572014601373 |
9 | 40163672054858 |
10 | 10221220201211 |
11 | 3290882378498 |
12 | 1190b35b6a98b |
13 | 591b1a89a676 |
14 | 2749d15a3935 |
15 | 12ad2630e3ab |
hex | 94bd03302fb |
10221220201211 has 8 divisors (see below), whose sum is σ = 10459273144320. Its totient is φ = 9983183173992.
The previous prime is 10221220201207. The next prime is 10221220201223. The reversal of 10221220201211 is 11210202212201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10221220201211 - 22 = 10221220201207 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 10221220201211.
It is not an unprimeable number, because it can be changed into a prime (10221220201271) 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, 2674691 + ... + 5253228.
It is an arithmetic number, because the mean of its divisors is an integer number (1307409143040).
Almost surely, 210221220201211 is an apocalyptic number.
10221220201211 is a deficient number, since it is larger than the sum of its proper divisors (238052943109).
10221220201211 is an equidigital number, since it uses as much as digits as its factorization.
10221220201211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7957945.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 10221220201211 its reverse (11210202212201), we get a palindrome (21431422413412).
The spelling of 10221220201211 in words is "ten trillion, two hundred twenty-one billion, two hundred twenty million, two hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •