Base | Representation |
---|---|
bin | 100000000001000110110… |
… | …100001110001011101101 |
3 | 21210100010111211020111122 |
4 | 200001012310032023231 |
5 | 242022013101202003 |
6 | 4402432501030325 |
7 | 314650200621410 |
oct | 40010664161355 |
9 | 7710114736448 |
10 | 2200211350253 |
11 | 779116a47614 |
12 | 2b64ba3b53a5 |
13 | 12c62c5b2b67 |
14 | 786c2a69b77 |
15 | 3c374c9e238 |
hex | 20046d0e2ed |
2200211350253 has 8 divisors (see below), whose sum is σ = 2525803166208. Its totient is φ = 1877438511504.
The previous prime is 2200211350177. The next prime is 2200211350289. The reversal of 2200211350253 is 3520531120022.
It is a happy number.
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 2200211350253 - 210 = 2200211349229 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2200211350453) 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, 704742626 + ... + 704745747.
It is an arithmetic number, because the mean of its divisors is an integer number (315725395776).
Almost surely, 22200211350253 is an apocalyptic number.
It is an amenable number.
2200211350253 is a deficient number, since it is larger than the sum of its proper divisors (325591815955).
2200211350253 is a wasteful number, since it uses less digits than its factorization.
2200211350253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1409488603.
The product of its (nonzero) digits is 3600, while the sum is 26.
Adding to 2200211350253 its reverse (3520531120022), we get a palindrome (5720742470275).
The spelling of 2200211350253 in words is "two trillion, two hundred billion, two hundred eleven million, three hundred fifty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •