Base | Representation |
---|---|
bin | 11101010000111111100… |
… | …000101010100110001101 |
3 | 21010021000201200121122222 |
4 | 131100333200222212031 |
5 | 230422223204102341 |
6 | 4135520303345125 |
7 | 265204120556342 |
oct | 35207740524615 |
9 | 7107021617588 |
10 | 2011110222221 |
11 | 7059a8322221 |
12 | 2859248b21a5 |
13 | 117854271269 |
14 | 6d4a42527c9 |
15 | 374a859044b |
hex | 1d43f82a98d |
2011110222221 has 2 divisors, whose sum is σ = 2011110222222. Its totient is φ = 2011110222220.
The previous prime is 2011110222211. The next prime is 2011110222271. The reversal of 2011110222221 is 1222220111102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1217248824100 + 793861398121 = 1103290^2 + 890989^2 .
It is a cyclic number.
It is not a de Polignac number, because 2011110222221 - 26 = 2011110222157 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2011110222221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2011110222211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005555111110 + 1005555111111.
It is an arithmetic number, because the mean of its divisors is an integer number (1005555111111).
Almost surely, 22011110222221 is an apocalyptic number.
It is an amenable number.
2011110222221 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011110222221 is an equidigital number, since it uses as much as digits as its factorization.
2011110222221 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 2011110222221 its reverse (1222220111102), we get a palindrome (3233330333323).
The spelling of 2011110222221 in words is "two trillion, eleven billion, one hundred ten million, two hundred twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •