Base | Representation |
---|---|
bin | 100000000010110001100… |
… | …111101000001111001101 |
3 | 21210111202101112012122101 |
4 | 200002301213220033031 |
5 | 242034200310224323 |
6 | 4403330350515101 |
7 | 315042456320011 |
oct | 40026147501715 |
9 | 7714671465571 |
10 | 2202003211213 |
11 | 779956452243 |
12 | 2b691a505a91 |
13 | 12c8568b3410 |
14 | 78812a24541 |
15 | 3c42c24adad |
hex | 200b19e83cd |
2202003211213 has 4 divisors (see below), whose sum is σ = 2371388073628. Its totient is φ = 2032618348800.
The previous prime is 2202003211139. The next prime is 2202003211217. The reversal of 2202003211213 is 3121123002022.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 348870966409 + 1853132244804 = 590653^2 + 1361298^2 .
It is a de Polignac number, because none of the positive numbers 2k-2202003211213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2202003211217) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 84692431188 + ... + 84692431213.
It is an arithmetic number, because the mean of its divisors is an integer number (592847018407).
Almost surely, 22202003211213 is an apocalyptic number.
It is an amenable number.
2202003211213 is a deficient number, since it is larger than the sum of its proper divisors (169384862415).
2202003211213 is a wasteful number, since it uses less digits than its factorization.
2202003211213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 169384862414.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 2202003211213 its reverse (3121123002022), we get a palindrome (5323126213235).
The spelling of 2202003211213 in words is "two trillion, two hundred two billion, three million, two hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •