Base | Representation |
---|---|
bin | 101111110001100000010010… |
… | …000000011010110100001001 |
3 | 1000112221022220021121121022022 |
4 | 233301200102000122310021 |
5 | 210014420442132020131 |
6 | 2022511125355134225 |
7 | 62153645126262152 |
oct | 5761402200326411 |
9 | 1015838807547268 |
10 | 210110102220041 |
11 | 60a47215164951 |
12 | 1b6948b4144375 |
13 | 90313b3b5441a |
14 | 39c5551744929 |
15 | 19456a506c37b |
hex | bf181201ad09 |
210110102220041 has 2 divisors, whose sum is σ = 210110102220042. Its totient is φ = 210110102220040.
The previous prime is 210110102220001. The next prime is 210110102220049. The reversal of 210110102220041 is 140022201011012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 149558126524816 + 60551975695225 = 12229396^2 + 7781515^2 .
It is a cyclic number.
It is not a de Polignac number, because 210110102220041 - 226 = 210110035111177 is a prime.
It is not a weakly prime, because it can be changed into another prime (210110102220049) 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 as a sum of consecutive naturals, namely, 105055051110020 + 105055051110021.
It is an arithmetic number, because the mean of its divisors is an integer number (105055051110021).
Almost surely, 2210110102220041 is an apocalyptic number.
It is an amenable number.
210110102220041 is a deficient number, since it is larger than the sum of its proper divisors (1).
210110102220041 is an equidigital number, since it uses as much as digits as its factorization.
210110102220041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 210110102220041 its reverse (140022201011012), we get a palindrome (350132303231053).
The spelling of 210110102220041 in words is "two hundred ten trillion, one hundred ten billion, one hundred two million, two hundred twenty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •