Base | Representation |
---|---|
bin | 100000000010000001110… |
… | …111101000011100101011 |
3 | 21210102200120002112200010 |
4 | 200002001313220130223 |
5 | 242031030214200021 |
6 | 4403115052143003 |
7 | 315013561064565 |
oct | 40020167503453 |
9 | 7712616075603 |
10 | 2201202100011 |
11 | 779585222572 |
12 | 2b6736167a63 |
13 | 12c759931815 |
14 | 7877848a335 |
15 | 3c3d1c54976 |
hex | 20081de872b |
2201202100011 has 8 divisors (see below), whose sum is σ = 2961862153360. Its totient is φ = 1454005056672.
The previous prime is 2201202099991. The next prime is 2201202100081. The reversal of 2201202100011 is 1100012021022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2201202100011 - 214 = 2201202083627 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 2201202100011.
It is not an unprimeable number, because it can be changed into a prime (2201202100081) 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, 3365752120 + ... + 3365752773.
It is an arithmetic number, because the mean of its divisors is an integer number (370232769170).
Almost surely, 22201202100011 is an apocalyptic number.
2201202100011 is a deficient number, since it is larger than the sum of its proper divisors (760660053349).
2201202100011 is a wasteful number, since it uses less digits than its factorization.
2201202100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6731505005.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 2201202100011 its reverse (1100012021022), we get a palindrome (3301214121033).
The spelling of 2201202100011 in words is "two trillion, two hundred one billion, two hundred two million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •