Base | Representation |
---|---|
bin | 110000000000001110111000… |
… | …011100111000000010111101 |
3 | 1000200112002022221202012200211 |
4 | 300000032320130320002331 |
5 | 210133011242233342341 |
6 | 2025004112200352421 |
7 | 62320035140462566 |
oct | 6000167034700275 |
9 | 1020462287665624 |
10 | 211122212012221 |
11 | 612a7477810954 |
12 | 1b818a95775711 |
13 | 90a597bc46363 |
14 | 3a1c5261c916d |
15 | 1961b8e9e0181 |
hex | c003b87380bd |
211122212012221 has 16 divisors (see below), whose sum is σ = 221520568808448. Its totient is φ = 200825469504000.
The previous prime is 211122212012219. The next prime is 211122212012263. The reversal of 211122212012221 is 122210212221112.
It is a cyclic number.
It is not a de Polignac number, because 211122212012221 - 21 = 211122212012219 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211122212012192 and 211122212012201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211122212012281) 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, 792364621 + ... + 792631021.
It is an arithmetic number, because the mean of its divisors is an integer number (13845035550528).
Almost surely, 2211122212012221 is an apocalyptic number.
It is an amenable number.
211122212012221 is a deficient number, since it is larger than the sum of its proper divisors (10398356796227).
211122212012221 is a wasteful number, since it uses less digits than its factorization.
211122212012221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 456972.
The product of its (nonzero) digits is 256, while the sum is 22.
Adding to 211122212012221 its reverse (122210212221112), we get a palindrome (333332424233333).
The spelling of 211122212012221 in words is "two hundred eleven trillion, one hundred twenty-two billion, two hundred twelve million, twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •