Base | Representation |
---|---|
bin | 101111110000000100001011… |
… | …101000011001011111001001 |
3 | 1000112120212122101100201201222 |
4 | 233300010023220121133021 |
5 | 210011310430004341131 |
6 | 2022353452441251425 |
7 | 62143544405005325 |
oct | 5760041350313711 |
9 | 1015525571321658 |
10 | 210011211012041 |
11 | 60a092886a967a |
12 | 1b6796b5793b75 |
13 | 9024c83c8342a |
14 | 39c084da70985 |
15 | 1942d1835387b |
hex | bf010ba197c9 |
210011211012041 has 2 divisors, whose sum is σ = 210011211012042. Its totient is φ = 210011211012040.
The previous prime is 210011211012023. The next prime is 210011211012121. The reversal of 210011211012041 is 140210112110012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 209353118521600 + 658092490441 = 14469040^2 + 811229^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210011211012041 is a prime.
It is not a weakly prime, because it can be changed into another prime (210011211014041) 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, 105005605506020 + 105005605506021.
It is an arithmetic number, because the mean of its divisors is an integer number (105005605506021).
Almost surely, 2210011211012041 is an apocalyptic number.
It is an amenable number.
210011211012041 is a deficient number, since it is larger than the sum of its proper divisors (1).
210011211012041 is an equidigital number, since it uses as much as digits as its factorization.
210011211012041 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 17.
Adding to 210011211012041 its reverse (140210112110012), we get a palindrome (350221323122053).
The spelling of 210011211012041 in words is "two hundred ten trillion, eleven billion, two hundred eleven million, twelve thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •