Base | Representation |
---|---|
bin | 11101010001000100110… |
… | …111100001101010010100 |
3 | 21010021020222210221012002 |
4 | 131101010313201222110 |
5 | 230422414211213022 |
6 | 4135533234014432 |
7 | 265206261535544 |
oct | 35210467415224 |
9 | 7107228727162 |
10 | 2011200101012 |
11 | 705a44030513 |
12 | 28594aa17418 |
13 | 117869a7cc8b |
14 | 6d4b216b324 |
15 | 374b13e6092 |
hex | 1d444de1a94 |
2011200101012 has 6 divisors (see below), whose sum is σ = 3519600176778. Its totient is φ = 1005600050504.
The previous prime is 2011200101011. The next prime is 2011200101021. The reversal of 2011200101012 is 2101010021102.
It can be written as a sum of positive squares in only one way, i.e., 1843088620816 + 168111480196 = 1357604^2 + 410014^2 .
It is a junction number, because it is equal to n+sod(n) for n = 2011200100984 and 2011200101002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011200101011) by changing a digit.
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 as a sum of consecutive naturals, namely, 251400012623 + ... + 251400012630.
It is an arithmetic number, because the mean of its divisors is an integer number (586600029463).
Almost surely, 22011200101012 is an apocalyptic number.
It is an amenable number.
2011200101012 is a deficient number, since it is larger than the sum of its proper divisors (1508400075766).
2011200101012 is a wasteful number, since it uses less digits than its factorization.
2011200101012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 502800025257 (or 502800025255 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2011200101012 its reverse (2101010021102), we get a palindrome (4112210122114).
The spelling of 2011200101012 in words is "two trillion, eleven billion, two hundred million, one hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •