Base | Representation |
---|---|
bin | 110000000001010111100001… |
… | …100111100110101111000011 |
3 | 1000200210112122220200022201221 |
4 | 300001113201213212233003 |
5 | 210140301013244231313 |
6 | 2025104012113135511 |
7 | 62325466066345441 |
oct | 6001274147465703 |
9 | 1020715586608657 |
10 | 211200212102083 |
11 | 61327563831936 |
12 | 1b83002385a597 |
13 | 90b012c935999 |
14 | 3a222054cdb91 |
15 | 1963c07617c8d |
hex | c015e19e6bc3 |
211200212102083 has 2 divisors, whose sum is σ = 211200212102084. Its totient is φ = 211200212102082.
The previous prime is 211200212102053. The next prime is 211200212102147. The reversal of 211200212102083 is 380201212002112.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-211200212102083 is a prime.
It is a super-2 number, since 2×2112002121020832 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (211200212102053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105600106051041 + 105600106051042.
It is an arithmetic number, because the mean of its divisors is an integer number (105600106051042).
Almost surely, 2211200212102083 is an apocalyptic number.
211200212102083 is a deficient number, since it is larger than the sum of its proper divisors (1).
211200212102083 is an equidigital number, since it uses as much as digits as its factorization.
211200212102083 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 25.
Adding to 211200212102083 its reverse (380201212002112), we get a palindrome (591401424104195).
The spelling of 211200212102083 in words is "two hundred eleven trillion, two hundred billion, two hundred twelve million, one hundred two thousand, eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.682 sec. • engine limits •