Base | Representation |
---|---|
bin | 100000000011000011100… |
… | …000100001110111101011 |
3 | 21210112112022021022221210 |
4 | 200003003200201313223 |
5 | 242040304123340021 |
6 | 4403420231404203 |
7 | 315053062344045 |
oct | 40030340416753 |
9 | 7715468238853 |
10 | 2202303340011 |
11 | 779a9a904475 |
12 | 2b69a2b23663 |
13 | 12c8a3b27a18 |
14 | 7884082ca95 |
15 | 3c448782e76 |
hex | 200c3821deb |
2202303340011 has 8 divisors (see below), whose sum is σ = 2937598608960. Its totient is φ = 1467605148872.
The previous prime is 2202303339961. The next prime is 2202303340067. The reversal of 2202303340011 is 1100433032022.
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 2202303340011 - 213 = 2202303331819 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2202303340011.
It is not an unprimeable number, because it can be changed into a prime (2202303342011) 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, 149260845 + ... + 149275598.
It is an arithmetic number, because the mean of its divisors is an integer number (367199826120).
Almost surely, 22202303340011 is an apocalyptic number.
2202303340011 is a deficient number, since it is larger than the sum of its proper divisors (735295268949).
2202303340011 is a wasteful number, since it uses less digits than its factorization.
2202303340011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 298538905.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 2202303340011 its reverse (1100433032022), we get a palindrome (3302736372033).
The spelling of 2202303340011 in words is "two trillion, two hundred two billion, three hundred three million, three hundred forty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •