Base | Representation |
---|---|
bin | 101101100001011110000100… |
… | …011011001011101010011011 |
3 | 222020220002111001000101101210 |
4 | 231201132010123023222123 |
5 | 202220233411242034321 |
6 | 1545452102412514203 |
7 | 60112564013410362 |
oct | 5541360433135233 |
9 | 866802431011353 |
10 | 200212122221211 |
11 | 58880536524791 |
12 | 1a55654a77b963 |
13 | 8793bcab667c9 |
14 | 3762465a5a7d9 |
15 | 1822e9b877b76 |
hex | b617846cba9b |
200212122221211 has 4 divisors (see below), whose sum is σ = 266949496294952. Its totient is φ = 133474748147472.
The previous prime is 200212122221197. The next prime is 200212122221227. The reversal of 200212122221211 is 112122221212002.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 200212122221211 - 247 = 59474633865883 is a prime.
It is a super-2 number, since 2×2002121222212112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200212122221231) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33368687036866 + ... + 33368687036871.
It is an arithmetic number, because the mean of its divisors is an integer number (66737374073738).
Almost surely, 2200212122221211 is an apocalyptic number.
200212122221211 is a deficient number, since it is larger than the sum of its proper divisors (66737374073741).
200212122221211 is an equidigital number, since it uses as much as digits as its factorization.
200212122221211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66737374073740.
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 200212122221211 its reverse (112122221212002), we get a palindrome (312334343433213).
The spelling of 200212122221211 in words is "two hundred trillion, two hundred twelve billion, one hundred twenty-two million, two hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •