Base | Representation |
---|---|
bin | 11101010001000100110… |
… | …111100001111101000011 |
3 | 21010021020222210222211111 |
4 | 131101010313201331003 |
5 | 230422414211232321 |
6 | 4135533234024151 |
7 | 265206261542206 |
oct | 35210467417503 |
9 | 7107228728744 |
10 | 2011200102211 |
11 | 705a44031403 |
12 | 28594aa18057 |
13 | 117869a806a1 |
14 | 6d4b216b93d |
15 | 374b13e65e1 |
hex | 1d444de1f43 |
2011200102211 has 8 divisors (see below), whose sum is σ = 2013554942784. Its totient is φ = 2008846633920.
The previous prime is 2011200102193. The next prime is 2011200102217. The reversal of 2011200102211 is 1122010021102.
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 2011200102211 - 27 = 2011200102083 is a prime.
It is a super-2 number, since 2×20112001022112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2011200102191 and 2011200102200.
It is not an unprimeable number, because it can be changed into a prime (2011200102217) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2604615 + ... + 3287311.
It is an arithmetic number, because the mean of its divisors is an integer number (251694367848).
Almost surely, 22011200102211 is an apocalyptic number.
2011200102211 is a deficient number, since it is larger than the sum of its proper divisors (2354840573).
2011200102211 is a wasteful number, since it uses less digits than its factorization.
2011200102211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 686141.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2011200102211 its reverse (1122010021102), we get a palindrome (3133210123313).
The spelling of 2011200102211 in words is "two trillion, eleven billion, two hundred million, one hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.462 sec. • engine limits •