Base | Representation |
---|---|
bin | 100000001100010010100… |
… | …110011011001001001101 |
3 | 21211111010102122000211112 |
4 | 200030102212123021031 |
5 | 242221111334014411 |
6 | 4412140244501405 |
7 | 315553610416412 |
oct | 40142246331115 |
9 | 7744112560745 |
10 | 2212220219981 |
11 | 783219707142 |
12 | 2b88b00aa865 |
13 | 1307c4531935 |
14 | 79101916109 |
15 | 3c8291c2b8b |
hex | 2031299b24d |
2212220219981 has 2 divisors, whose sum is σ = 2212220219982. Its totient is φ = 2212220219980.
The previous prime is 2212220219953. The next prime is 2212220220017. The reversal of 2212220219981 is 1899120222122.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1739576344900 + 472643875081 = 1318930^2 + 687491^2 .
It is a cyclic number.
It is not a de Polignac number, because 2212220219981 - 26 = 2212220219917 is a prime.
It is a super-2 number, since 2×22122202199812 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2212220219381) 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, 1106110109990 + 1106110109991.
It is an arithmetic number, because the mean of its divisors is an integer number (1106110109991).
Almost surely, 22212220219981 is an apocalyptic number.
It is an amenable number.
2212220219981 is a deficient number, since it is larger than the sum of its proper divisors (1).
2212220219981 is an equidigital number, since it uses as much as digits as its factorization.
2212220219981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41472, while the sum is 41.
The spelling of 2212220219981 in words is "two trillion, two hundred twelve billion, two hundred twenty million, two hundred nineteen thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •