Base | Representation |
---|---|
bin | 1001001100011111000101… |
… | …00100001110110110101001 |
3 | 2122121000220100120220022202 |
4 | 10212033202210032312221 |
5 | 10122241443311223423 |
6 | 111001012014025545 |
7 | 4154601464646035 |
oct | 446174244166651 |
9 | 78530810526282 |
10 | 20220212211113 |
11 | 6496386720642 |
12 | 23269901a82b5 |
13 | b389b0c4bc35 |
14 | 4dc9408a51c5 |
15 | 250e929e3728 |
hex | 1263e290eda9 |
20220212211113 has 2 divisors, whose sum is σ = 20220212211114. Its totient is φ = 20220212211112.
The previous prime is 20220212211097. The next prime is 20220212211131. The reversal of 20220212211113 is 31111221202202.
Together with next prime (20220212211131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12820789455769 + 7399422755344 = 3580613^2 + 2720188^2 .
It is a cyclic number.
It is not a de Polignac number, because 20220212211113 - 24 = 20220212211097 is a prime.
It is not a weakly prime, because it can be changed into another prime (20220212211163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10110106105556 + 10110106105557.
It is an arithmetic number, because the mean of its divisors is an integer number (10110106105557).
Almost surely, 220220212211113 is an apocalyptic number.
It is an amenable number.
20220212211113 is a deficient number, since it is larger than the sum of its proper divisors (1).
20220212211113 is an equidigital number, since it uses as much as digits as its factorization.
20220212211113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 20220212211113 its reverse (31111221202202), we get a palindrome (51331433413315).
The spelling of 20220212211113 in words is "twenty trillion, two hundred twenty billion, two hundred twelve million, two hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.949 sec. • engine limits •