Base | Representation |
---|---|
bin | 1010000111010001111110… |
… | …0100100111010011011011 |
3 | 1110101002011212012102022212 |
4 | 2201310133210213103123 |
5 | 2424143132201134321 |
6 | 35352314355105335 |
7 | 2225256631412051 |
oct | 241643744472333 |
9 | 43332155172285 |
10 | 11120200021211 |
11 | 35a8061010a16 |
12 | 12b72045a224b |
13 | 628826ba2268 |
14 | 2a63132a81d1 |
15 | 1443ddec055b |
hex | a1d1f9274db |
11120200021211 has 8 divisors (see below), whose sum is σ = 11133725184000. Its totient is φ = 11106683003752.
The previous prime is 11120200021207. The next prime is 11120200021261. The reversal of 11120200021211 is 11212000202111.
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 11120200021211 - 22 = 11120200021207 is a prime.
It is a super-3 number, since 3×111202000212113 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11120200021261) 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, 698006 + ... + 4767348.
It is an arithmetic number, because the mean of its divisors is an integer number (1391715648000).
Almost surely, 211120200021211 is an apocalyptic number.
11120200021211 is a deficient number, since it is larger than the sum of its proper divisors (13525162789).
11120200021211 is a wasteful number, since it uses less digits than its factorization.
11120200021211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4072665.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11120200021211 its reverse (11212000202111), we get a palindrome (22332200223322).
The spelling of 11120200021211 in words is "eleven trillion, one hundred twenty billion, two hundred million, twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •