Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …100110001001001100011100 |
3 | 222020212222120220021112010220 |
4 | 231201131001212021030130 |
5 | 202220224112230134322 |
6 | 1545451355241401340 |
7 | 60112524150356616 |
oct | 5541350146111434 |
9 | 866788526245126 |
10 | 200211001021212 |
11 | 5888001064a615 |
12 | 1a556297199250 |
13 | 8793a7c7a245c |
14 | 376239ab9ddb6 |
15 | 1822e3320555c |
hex | b6174198931c |
200211001021212 has 96 divisors (see below), whose sum is σ = 478764486369792. Its totient is φ = 65093905234176.
The previous prime is 200211001021169. The next prime is 200211001021231. The reversal of 200211001021212 is 212120100112002.
It is a junction number, because it is equal to n+sod(n) for n = 200211001021191 and 200211001021200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1446468913 + ... + 1446607319.
It is an arithmetic number, because the mean of its divisors is an integer number (4987130066352).
Almost surely, 2200211001021212 is an apocalyptic number.
It is an amenable number.
200211001021212 is an abundant number, since it is smaller than the sum of its proper divisors (278553485348580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200211001021212 is a wasteful number, since it uses less digits than its factorization.
200211001021212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151787 (or 151785 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 200211001021212 its reverse (212120100112002), we get a palindrome (412331101133214).
The spelling of 200211001021212 in words is "two hundred trillion, two hundred eleven billion, one million, twenty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •