Base | Representation |
---|---|
bin | 1011101001100000010… |
… | …1100110100101011011 |
3 | 201010112201021110101102 |
4 | 2322120011212211123 |
5 | 11234321221214321 |
6 | 231533420142015 |
7 | 20313106536212 |
oct | 2723005464533 |
9 | 633481243342 |
10 | 200120101211 |
11 | 77963641aa8 |
12 | 3294b99790b |
13 | 15b43180194 |
14 | 9986026079 |
15 | 5313c99c0b |
hex | 2e9816695b |
200120101211 has 16 divisors (see below), whose sum is σ = 203863080960. Its totient is φ = 196421124480.
The previous prime is 200120101121. The next prime is 200120101273. The reversal of 200120101211 is 112101021002.
200120101211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 200120101211 - 218 = 200119839067 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200120101192 and 200120101201.
It is not an unprimeable number, because it can be changed into a prime (200120101411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4792220 + ... + 4833798.
It is an arithmetic number, because the mean of its divisors is an integer number (12741442560).
Almost surely, 2200120101211 is an apocalyptic number.
200120101211 is a deficient number, since it is larger than the sum of its proper divisors (3742979749).
200120101211 is a wasteful number, since it uses less digits than its factorization.
200120101211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42106.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 200120101211 its reverse (112101021002), we get a palindrome (312221122213).
The spelling of 200120101211 in words is "two hundred billion, one hundred twenty million, one hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •