Base | Representation |
---|---|
bin | 101101100001011110001001… |
… | …101101111000111000110001 |
3 | 222020220002201020002101020222 |
4 | 231201132021231320320301 |
5 | 202220234102004323441 |
6 | 1545452115303542425 |
7 | 60112566142203161 |
oct | 5541361155707061 |
9 | 866802636071228 |
10 | 200212211011121 |
11 | 58880581659981 |
12 | 1a55657445aa15 |
13 | 8793c13383a0a |
14 | 37624737705a1 |
15 | 1822ea4565d4b |
hex | b61789b78e31 |
200212211011121 has 16 divisors (see below), whose sum is σ = 214081744564800. Its totient is φ = 186692872961088.
The previous prime is 200212211011117. The next prime is 200212211011133. The reversal of 200212211011121 is 121110112212002.
It is a cyclic number.
It is not a de Polignac number, because 200212211011121 - 22 = 200212211011117 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 200212211011121.
It is not an unprimeable number, because it can be changed into a prime (200212211071121) 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, 235556546 + ... + 236404971.
It is an arithmetic number, because the mean of its divisors is an integer number (13380109035300).
Almost surely, 2200212211011121 is an apocalyptic number.
It is an amenable number.
200212211011121 is a deficient number, since it is larger than the sum of its proper divisors (13869533553679).
200212211011121 is a wasteful number, since it uses less digits than its factorization.
200212211011121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 471961888.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 200212211011121 its reverse (121110112212002), we get a palindrome (321322323223123).
The spelling of 200212211011121 in words is "two hundred trillion, two hundred twelve billion, two hundred eleven million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •