Base | Representation |
---|---|
bin | 110000000001100010101110… |
… | …100110010000110101010111 |
3 | 1000200211200201020012100220221 |
4 | 300001202232212100311113 |
5 | 210141000132144422403 |
6 | 2025113321454335211 |
7 | 62326403141410000 |
oct | 6001425646206527 |
9 | 1020750636170827 |
10 | 211212241014103 |
11 | 6133167684053a |
12 | 1b8324201ba507 |
13 | 90b12c8a811c4 |
14 | 3a22a26cb61a7 |
15 | 19641ad699dbd |
hex | c018ae990d57 |
211212241014103 has 80 divisors (see below), whose sum is σ = 251430653563200. Its totient is φ = 177390968122368.
The previous prime is 211212241014101. The next prime is 211212241014119. The reversal of 211212241014103 is 301410142212112.
It is not a de Polignac number, because 211212241014103 - 21 = 211212241014101 is a prime.
It is a super-2 number, since 2×2112122410141032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211212241014101) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 8476619601 + ... + 8476644517.
It is an arithmetic number, because the mean of its divisors is an integer number (3142883169540).
Almost surely, 2211212241014103 is an apocalyptic number.
211212241014103 is a deficient number, since it is larger than the sum of its proper divisors (40218412549097).
211212241014103 is a wasteful number, since it uses less digits than its factorization.
211212241014103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25414 (or 25393 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 25.
Adding to 211212241014103 its reverse (301410142212112), we get a palindrome (512622383226215).
The spelling of 211212241014103 in words is "two hundred eleven trillion, two hundred twelve billion, two hundred forty-one million, fourteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •