Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …100110001000111011010000 |
3 | 222020212222120220021110122011 |
4 | 231201131001212020323100 |
5 | 202220224112230120422 |
6 | 1545451355241352304 |
7 | 60112524150353455 |
oct | 5541350146107320 |
9 | 866788526243564 |
10 | 200211001020112 |
11 | 58880010649805 |
12 | 1a556297198694 |
13 | 8793a7c7a1ac4 |
14 | 376239ab9d82c |
15 | 1822e33205077 |
hex | b61741988ed0 |
200211001020112 has 160 divisors (see below), whose sum is σ = 400532522277888. Its totient is φ = 96890465280000.
The previous prime is 200211001020103. The next prime is 200211001020161. The reversal of 200211001020112 is 211020100112002.
It is a junction number, because it is equal to n+sod(n) for n = 200211001020092 and 200211001020101.
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, 70571377158 + ... + 70571379994.
Almost surely, 2200211001020112 is an apocalyptic number.
It is an amenable number.
200211001020112 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
200211001020112 is a wasteful number, since it uses less digits than its factorization.
200211001020112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4709 (or 4703 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200211001020112 its reverse (211020100112002), we get a palindrome (411231101132114).
The spelling of 200211001020112 in words is "two hundred trillion, two hundred eleven billion, one million, twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •