Base | Representation |
---|---|
bin | 100000000001000110110… |
… | …010111101110011010011 |
3 | 21210100010111012111212111 |
4 | 200001012302331303103 |
5 | 242022013010133021 |
6 | 4402432450010151 |
7 | 314650165050463 |
oct | 40010662756323 |
9 | 7710114174774 |
10 | 2200211021011 |
11 | 779116842213 |
12 | 2b64ba276957 |
13 | 12c62c4c9043 |
14 | 786c29c1ba3 |
15 | 3c374c368e1 |
hex | 20046cbdcd3 |
2200211021011 has 8 divisors (see below), whose sum is σ = 2222492104800. Its totient is φ = 2178042185088.
The previous prime is 2200211020993. The next prime is 2200211021017. The reversal of 2200211021011 is 1101201120022.
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 2200211021011 - 211 = 2200211018963 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2200211020982 and 2200211021000.
It is not an unprimeable number, because it can be changed into a prime (2200211021017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28022566 + ... + 28100971.
It is an arithmetic number, because the mean of its divisors is an integer number (277811513100).
Almost surely, 22200211021011 is an apocalyptic number.
2200211021011 is a deficient number, since it is larger than the sum of its proper divisors (22281083789).
2200211021011 is a wasteful number, since it uses less digits than its factorization.
2200211021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56123933.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2200211021011 its reverse (1101201120022), we get a palindrome (3301412141033).
The spelling of 2200211021011 in words is "two trillion, two hundred billion, two hundred eleven million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •