Base | Representation |
---|---|
bin | 101101100000001000011000… |
… | …110000000001010010101011 |
3 | 222020120022000100022000101010 |
4 | 231200020120300001102223 |
5 | 202212232002041244321 |
6 | 1545341525320355003 |
7 | 60103126110532002 |
oct | 5540103060012253 |
9 | 866508010260333 |
10 | 200120121431211 |
11 | 58845515477543 |
12 | 1a540753915a63 |
13 | 8788328681727 |
14 | 375bc19139c39 |
15 | 18208b4a2e676 |
hex | b60218c014ab |
200120121431211 has 4 divisors (see below), whose sum is σ = 266826828574952. Its totient is φ = 133413414287472.
The previous prime is 200120121431183. The next prime is 200120121431281. The reversal of 200120121431211 is 112134121021002.
It is a semiprime because it is the product of two primes.
It is a de Polignac number, because none of the positive numbers 2k-200120121431211 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200120121431281) by changing a digit.
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, 33353353571866 + ... + 33353353571871.
It is an arithmetic number, because the mean of its divisors is an integer number (66706707143738).
Almost surely, 2200120121431211 is an apocalyptic number.
200120121431211 is a deficient number, since it is larger than the sum of its proper divisors (66706707143741).
200120121431211 is an equidigital number, since it uses as much as digits as its factorization.
200120121431211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66706707143740.
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 200120121431211 its reverse (112134121021002), we get a palindrome (312254242452213).
The spelling of 200120121431211 in words is "two hundred trillion, one hundred twenty billion, one hundred twenty-one million, four hundred thirty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •