Base | Representation |
---|---|
bin | 1010001011111100000000… |
… | …0000100101110011110011 |
3 | 1110122201200021101100222011 |
4 | 2202333000000211303303 |
5 | 2432001002441333021 |
6 | 35453145032223351 |
7 | 2234121265504060 |
oct | 242770000456363 |
9 | 43581607340864 |
10 | 11200201121011 |
11 | 3628a845a9321 |
12 | 130a81083ab57 |
13 | 633236300836 |
14 | 2aa14224bc67 |
15 | 146522609de1 |
hex | a2fc0025cf3 |
11200201121011 has 16 divisors (see below), whose sum is σ = 13342698167040. Its totient is φ = 9198375207840.
The previous prime is 11200201120993. The next prime is 11200201121033. The reversal of 11200201121011 is 11012110200211.
It is a happy number.
It is not a de Polignac number, because 11200201121011 - 215 = 11200201088243 is a prime.
It is a super-2 number, since 2×112002011210112 (a number of 27 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 = 11200201120982 and 11200201121000.
It is not an unprimeable number, because it can be changed into a prime (11200201131011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 210558921 + ... + 210612106.
It is an arithmetic number, because the mean of its divisors is an integer number (833918635440).
Almost surely, 211200201121011 is an apocalyptic number.
11200201121011 is a deficient number, since it is larger than the sum of its proper divisors (2142497046029).
11200201121011 is a wasteful number, since it uses less digits than its factorization.
11200201121011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 421171194.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11200201121011 its reverse (11012110200211), we get a palindrome (22212311321222).
The spelling of 11200201121011 in words is "eleven trillion, two hundred billion, two hundred one million, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •