Base | Representation |
---|---|
bin | 110000000000000101011000… |
… | …011111110000101100011100 |
3 | 1000200111010000010001010211110 |
4 | 300000011120133300230130 |
5 | 210132324400112034322 |
6 | 2024555304115422020 |
7 | 62316224315623554 |
oct | 6000053037605434 |
9 | 1020433003033743 |
10 | 211112012221212 |
11 | 612a3113246a03 |
12 | 1b816b098b4910 |
13 | 90a4a14a45a6b |
14 | 3a1bc396da164 |
15 | 1961794319c0c |
hex | c001587f0b1c |
211112012221212 has 24 divisors (see below), whose sum is σ = 492603537120912. Its totient is φ = 70369407606400.
The previous prime is 211112012221133. The next prime is 211112012221213. The reversal of 211112012221212 is 212122210211112.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211112012221213) 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 7 ways as a sum of consecutive naturals, for example, 157195239 + ... + 158532542.
It is an arithmetic number, because the mean of its divisors is an integer number (20525147380038).
Almost surely, 2211112012221212 is an apocalyptic number.
It is an amenable number.
211112012221212 is an abundant number, since it is smaller than the sum of its proper divisors (281491524899700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211112012221212 is a wasteful number, since it uses less digits than its factorization.
211112012221212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 315783509 (or 315783507 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 21.
Adding to 211112012221212 its reverse (212122210211112), we get a palindrome (423234222432324).
The spelling of 211112012221212 in words is "two hundred eleven trillion, one hundred twelve billion, twelve million, two hundred twenty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •