Base | Representation |
---|---|
bin | 110000000001010111011011… |
… | …100110101110111000100110 |
3 | 1000200210112101212211110211221 |
4 | 300001113123212232320212 |
5 | 210140300311432210042 |
6 | 2025103554110450554 |
7 | 62325463432646464 |
oct | 6001273346567046 |
9 | 1020715355743757 |
10 | 211200111210022 |
11 | 61327511891170 |
12 | 1b82bbb5b03a5a |
13 | 90b0114a6c13c |
14 | 3a221d5d49834 |
15 | 1963bed838d67 |
hex | c015db9aee26 |
211200111210022 has 32 divisors (see below), whose sum is σ = 357550383163680. Its totient is φ = 92681160472320.
The previous prime is 211200111210001. The next prime is 211200111210031. The reversal of 211200111210022 is 220012111002112.
211200111210022 is digitally balanced in base 2, 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 = 211200111209978 and 211200111210005.
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, 8326623 + ... + 22175050.
It is an arithmetic number, because the mean of its divisors is an integer number (11173449473865).
Almost surely, 2211200111210022 is an apocalyptic number.
211200111210022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
211200111210022 is a deficient number, since it is larger than the sum of its proper divisors (146350271953658).
211200111210022 is a wasteful number, since it uses less digits than its factorization.
211200111210022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30512568.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 211200111210022 its reverse (220012111002112), we get a palindrome (431212222212134).
The spelling of 211200111210022 in words is "two hundred eleven trillion, two hundred billion, one hundred eleven million, two hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •