Base | Representation |
---|---|
bin | 110000000000001101110001… |
… | …011110010101000110000011 |
3 | 1000200111222020222001020112022 |
4 | 300000031301132111012003 |
5 | 210133001322412223021 |
6 | 2025003354101352055 |
7 | 62316663501026132 |
oct | 6000156136250603 |
9 | 1020458228036468 |
10 | 211121021211011 |
11 | 612a6a1661831a |
12 | 1b818802a0862b |
13 | 90a581c322b62 |
14 | 3a1c451db1919 |
15 | 1961b201c01ab |
hex | c00371795183 |
211121021211011 has 4 divisors (see below), whose sum is σ = 211122198489792. Its totient is φ = 211119843932232.
The previous prime is 211121021210989. The next prime is 211121021211031. The reversal of 211121021211011 is 110112120121112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-211121021211011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211121021211031) 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 in 3 ways as a sum of consecutive naturals, for example, 588370355 + ... + 588729068.
It is an arithmetic number, because the mean of its divisors is an integer number (52780549622448).
Almost surely, 2211121021211011 is an apocalyptic number.
211121021211011 is a deficient number, since it is larger than the sum of its proper divisors (1177278781).
211121021211011 is a wasteful number, since it uses less digits than its factorization.
211121021211011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1177278780.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 211121021211011 its reverse (110112120121112), we get a palindrome (321233141332123).
The spelling of 211121021211011 in words is "two hundred eleven trillion, one hundred twenty-one billion, twenty-one million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •