Base | Representation |
---|---|
bin | 1100010010110100011… |
… | …1000000111011100001 |
3 | 202012011121021102001221 |
4 | 3010231013000323201 |
5 | 11430024303223131 |
6 | 241010103455041 |
7 | 21154662113014 |
oct | 3045507007341 |
9 | 665147242057 |
10 | 211210211041 |
11 | 81634726725 |
12 | 34b25a57481 |
13 | 16bbc96774b |
14 | a318c7137b |
15 | 57626d8411 |
hex | 312d1c0ee1 |
211210211041 has 2 divisors, whose sum is σ = 211210211042. Its totient is φ = 211210211040.
The previous prime is 211210211011. The next prime is 211210211057. The reversal of 211210211041 is 140112012112.
It is an a-pointer prime, because the next prime (211210211057) can be obtained adding 211210211041 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 167120710416 + 44089500625 = 408804^2 + 209975^2 .
It is a cyclic number.
It is not a de Polignac number, because 211210211041 - 29 = 211210210529 is a prime.
It is not a weakly prime, because it can be changed into another prime (211210211011) 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 as a sum of consecutive naturals, namely, 105605105520 + 105605105521.
It is an arithmetic number, because the mean of its divisors is an integer number (105605105521).
Almost surely, 2211210211041 is an apocalyptic number.
It is an amenable number.
211210211041 is a deficient number, since it is larger than the sum of its proper divisors (1).
211210211041 is an equidigital number, since it uses as much as digits as its factorization.
211210211041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 211210211041 its reverse (140112012112), we get a palindrome (351322223153).
The spelling of 211210211041 in words is "two hundred eleven billion, two hundred ten million, two hundred eleven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •