Base | Representation |
---|---|
bin | 11101010001000100110… |
… | …111111100100001000010 |
3 | 21010021021000000112002002 |
4 | 131101010313330201002 |
5 | 230422414223223020 |
6 | 4135533240224002 |
7 | 265206262504334 |
oct | 35210467744102 |
9 | 7107230015062 |
10 | 2011200211010 |
11 | 705a440a6121 |
12 | 28594aa6b002 |
13 | 117869abb073 |
14 | 6d4b2199454 |
15 | 374b1418975 |
hex | 1d444dfc842 |
2011200211010 has 8 divisors (see below), whose sum is σ = 3620160379836. Its totient is φ = 804480084400.
The previous prime is 2011200210989. The next prime is 2011200211063. The reversal of 2011200211010 is 101120021102.
It can be written as a sum of positive squares in 2 ways, for example, as 1757064244849 + 254135966161 = 1325543^2 + 504119^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 2011200210982 and 2011200211000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 100560010541 + ... + 100560010560.
Almost surely, 22011200211010 is an apocalyptic number.
2011200211010 is a deficient number, since it is larger than the sum of its proper divisors (1608960168826).
2011200211010 is a wasteful number, since it uses less digits than its factorization.
2011200211010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201120021108.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2011200211010 its reverse (101120021102), we get a palindrome (2112320232112).
The spelling of 2011200211010 in words is "two trillion, eleven billion, two hundred million, two hundred eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •