Base | Representation |
---|---|
bin | 110000000000001110110111… |
… | …101111110100101111101101 |
3 | 1000200112002022010112012102102 |
4 | 300000032313233310233231 |
5 | 210133011231222432341 |
6 | 2025004111055304445 |
7 | 62320034635214240 |
oct | 6000166757645755 |
9 | 1020462263465372 |
10 | 211122200202221 |
11 | 612a7471084920 |
12 | 1b818a9181b125 |
13 | 90a597966c9a9 |
14 | 3a1c5247d3257 |
15 | 1961b8d95ac9b |
hex | c003b7bf4bed |
211122200202221 has 32 divisors (see below), whose sum is σ = 266833776633600. Its totient is φ = 162250682273280.
The previous prime is 211122200202197. The next prime is 211122200202289. The reversal of 211122200202221 is 122202002221112.
It is a cyclic number.
It is not a de Polignac number, because 211122200202221 - 230 = 211121126460397 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 211122200202193 and 211122200202202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211122200222221) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 140841815 + ... + 142332923.
It is an arithmetic number, because the mean of its divisors is an integer number (8338555519800).
Almost surely, 2211122200202221 is an apocalyptic number.
It is an amenable number.
211122200202221 is a deficient number, since it is larger than the sum of its proper divisors (55711576431379).
211122200202221 is a wasteful number, since it uses less digits than its factorization.
211122200202221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1516389.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 211122200202221 its reverse (122202002221112), we get a palindrome (333324202423333).
The spelling of 211122200202221 in words is "two hundred eleven trillion, one hundred twenty-two billion, two hundred million, two hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •