Base | Representation |
---|---|
bin | 1011101001011110001… |
… | …1010001100100000100 |
3 | 201010112002100021002011 |
4 | 2322113203101210010 |
5 | 11234311420232322 |
6 | 231532455224004 |
7 | 20312640206110 |
oct | 2722743214404 |
9 | 633462307064 |
10 | 200111102212 |
11 | 77959555a0a |
12 | 32948978004 |
13 | 15b4134c128 |
14 | 9984b62740 |
15 | 53130bd677 |
hex | 2e978d1904 |
200111102212 has 12 divisors (see below), whose sum is σ = 400222204480. Its totient is φ = 85761900936.
The previous prime is 200111102201. The next prime is 200111102221. The reversal of 200111102212 is 212201111002.
200111102212 is an admirable number.
It is a super-2 number, since 2×2001111022122 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200111102192 and 200111102201.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3573412512 + ... + 3573412567.
Almost surely, 2200111102212 is an apocalyptic number.
It is an amenable number.
200111102212 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200111102212 is a wasteful number, since it uses less digits than its factorization.
200111102212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7146825090 (or 7146825088 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200111102212 its reverse (212201111002), we get a palindrome (412312213214).
The spelling of 200111102212 in words is "two hundred billion, one hundred eleven million, one hundred two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •