Base | Representation |
---|---|
bin | 100000000010110010101… |
… | …011100001111001000011 |
3 | 21210111210122000112101011 |
4 | 200002302223201321003 |
5 | 242034214334323021 |
6 | 4403332224221351 |
7 | 315043063523323 |
oct | 40026253417103 |
9 | 7714718015334 |
10 | 2202021011011 |
11 | 7799654aa518 |
12 | 2b692446a857 |
13 | 12c85a4a6243 |
14 | 78815139283 |
15 | 3c42dab4de1 |
hex | 200b2ae1e43 |
2202021011011 has 4 divisors (see below), whose sum is σ = 2297761054992. Its totient is φ = 2106280967032.
The previous prime is 2202021010997. The next prime is 2202021011051. The reversal of 2202021011011 is 1101101202022.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2202021011011 - 217 = 2202020879939 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2202021010982 and 2202021011000.
It is not an unprimeable number, because it can be changed into a prime (2202021011051) 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 3 ways as a sum of consecutive naturals, for example, 47870021956 + ... + 47870022001.
It is an arithmetic number, because the mean of its divisors is an integer number (574440263748).
Almost surely, 22202021011011 is an apocalyptic number.
2202021011011 is a deficient number, since it is larger than the sum of its proper divisors (95740043981).
2202021011011 is an equidigital number, since it uses as much as digits as its factorization.
2202021011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95740043980.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2202021011011 its reverse (1101101202022), we get a palindrome (3303122213033).
The spelling of 2202021011011 in words is "two trillion, two hundred two billion, twenty-one million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •