Base | Representation |
---|---|
bin | 101101100001011101001000… |
… | …101111110100111100010100 |
3 | 222020212222220021001002101120 |
4 | 231201131020233310330110 |
5 | 202220224333434001322 |
6 | 1545451415205123540 |
7 | 60112530135232620 |
oct | 5541351057647424 |
9 | 866788807032346 |
10 | 200211121000212 |
11 | 58880072347613 |
12 | 1a55630b3b95b0 |
13 | 8793a9b5bc94a |
14 | 37623acab2180 |
15 | 1822e3da04a5c |
hex | b61748bf4f14 |
200211121000212 has 96 divisors (see below), whose sum is σ = 552570942739200. Its totient is φ = 55204213865472.
The previous prime is 200211121000207. The next prime is 200211121000213. The reversal of 200211121000212 is 212000121112002.
It is a junction number, because it is equal to n+sod(n) for n = 200211121000191 and 200211121000200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200211121000213) 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, 14582923 + ... + 24760530.
It is an arithmetic number, because the mean of its divisors is an integer number (5755947320200).
Almost surely, 2200211121000212 is an apocalyptic number.
It is an amenable number.
200211121000212 is an abundant number, since it is smaller than the sum of its proper divisors (352359821738988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200211121000212 is a wasteful number, since it uses less digits than its factorization.
200211121000212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39345585 (or 39345583 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 200211121000212 its reverse (212000121112002), we get a palindrome (412211242112214).
The spelling of 200211121000212 in words is "two hundred trillion, two hundred eleven billion, one hundred twenty-one million, two hundred twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •