Base | Representation |
---|---|
bin | 1100110100010110011… |
… | …0101110100001101001 |
3 | 210001101220001120000122 |
4 | 3031011212232201221 |
5 | 12101443021041131 |
6 | 245055200213025 |
7 | 21624015365624 |
oct | 3150546564151 |
9 | 701356046018 |
10 | 220211112041 |
11 | 85433482888 |
12 | 3681830a175 |
13 | 179c5671b7b |
14 | a93043cdbb |
15 | 5adc9e1d7b |
hex | 33459ae869 |
220211112041 has 2 divisors, whose sum is σ = 220211112042. Its totient is φ = 220211112040.
The previous prime is 220211111921. The next prime is 220211112083. The reversal of 220211112041 is 140211112022.
220211112041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 111983929600 + 108227182441 = 334640^2 + 328979^2 .
It is a cyclic number.
It is not a de Polignac number, because 220211112041 - 210 = 220211111017 is a prime.
It is not a weakly prime, because it can be changed into another prime (220241112041) 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, 110105556020 + 110105556021.
It is an arithmetic number, because the mean of its divisors is an integer number (110105556021).
Almost surely, 2220211112041 is an apocalyptic number.
It is an amenable number.
220211112041 is a deficient number, since it is larger than the sum of its proper divisors (1).
220211112041 is an equidigital number, since it uses as much as digits as its factorization.
220211112041 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 220211112041 its reverse (140211112022), we get a palindrome (360422224063).
The spelling of 220211112041 in words is "two hundred twenty billion, two hundred eleven million, one hundred twelve thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •