Base | Representation |
---|---|
bin | 100000000001110111000… |
… | …101010000001010111011 |
3 | 21210102012221112212102121 |
4 | 200001313011100022323 |
5 | 242030142401334321 |
6 | 4403045105142111 |
7 | 315006232561603 |
oct | 40016705201273 |
9 | 7712187485377 |
10 | 2201021121211 |
11 | 7794a2051510 |
12 | 2b66a562a937 |
13 | 12c72b2a7283 |
14 | 7875c419c03 |
15 | 3c3c0e06441 |
hex | 200771502bb |
2201021121211 has 8 divisors (see below), whose sum is σ = 2401130907648. Its totient is φ = 2000914161000.
The previous prime is 2201021121191. The next prime is 2201021121217. The reversal of 2201021121211 is 1121211201022.
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 2201021121211 - 25 = 2201021121179 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2201021121217) 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 7 ways as a sum of consecutive naturals, for example, 1129206 + ... + 2382676.
It is an arithmetic number, because the mean of its divisors is an integer number (300141363456).
Almost surely, 22201021121211 is an apocalyptic number.
2201021121211 is a deficient number, since it is larger than the sum of its proper divisors (200109786437).
2201021121211 is a wasteful number, since it uses less digits than its factorization.
2201021121211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1413113.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 2201021121211 its reverse (1121211201022), we get a palindrome (3322232322233).
It can be divided in two parts, 2201021 and 121211, that added together give a palindrome (2322232).
The spelling of 2201021121211 in words is "two trillion, two hundred one billion, twenty-one million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •