Base | Representation |
---|---|
bin | 101101011110011000100111… |
… | …100101010111001000001110 |
3 | 222020010211020121220011102011 |
4 | 231132120213211113020032 |
5 | 202203300211432223042 |
6 | 1545210441021051434 |
7 | 60061350125512063 |
oct | 5536304745271016 |
9 | 866124217804364 |
10 | 200000111211022 |
11 | 587a9630871891 |
12 | 1a5214406b6b7a |
13 | 8779c11329515 |
14 | 37560b26d2c6a |
15 | 181c6ddc0aa17 |
hex | b5e62795720e |
200000111211022 has 32 divisors (see below), whose sum is σ = 304116242212800. Its totient is φ = 98633589331200.
The previous prime is 200000111210989. The next prime is 200000111211119. The reversal of 200000111211022 is 220112111000002.
200000111211022 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 200000111210993 and 200000111211011.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 982260447 + ... + 982464037.
It is an arithmetic number, because the mean of its divisors is an integer number (9503632569150).
Almost surely, 2200000111211022 is an apocalyptic number.
200000111211022 is a deficient number, since it is larger than the sum of its proper divisors (104116131001778).
200000111211022 is a wasteful number, since it uses less digits than its factorization.
200000111211022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217212.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200000111211022 its reverse (220112111000002), we get a palindrome (420112222211024).
The spelling of 200000111211022 in words is "two hundred trillion, one hundred eleven million, two hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •