Base | Representation |
---|---|
bin | 1010000000111011011001… |
… | …01101001110010101001111 |
3 | 2212222021221111002202000102 |
4 | 11000131230231032111033 |
5 | 10341302301001333403 |
6 | 114500453415321315 |
7 | 4432021455656255 |
oct | 500355455162517 |
9 | 85867844082012 |
10 | 22022121121103 |
11 | 7020590291594 |
12 | 257804b98023b |
13 | c398a57c737c |
14 | 561c3a9ba5d5 |
15 | 282ca4e19b88 |
hex | 14076cb4e54f |
22022121121103 has 2 divisors, whose sum is σ = 22022121121104. Its totient is φ = 22022121121102.
The previous prime is 22022121121093. The next prime is 22022121121123. The reversal of 22022121121103 is 30112112122022.
It is an a-pointer prime, because the next prime (22022121121123) can be obtained adding 22022121121103 to its sum of digits (20).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 22022121121103 - 28 = 22022121120847 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22022121121123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11011060560551 + 11011060560552.
It is an arithmetic number, because the mean of its divisors is an integer number (11011060560552).
Almost surely, 222022121121103 is an apocalyptic number.
22022121121103 is a deficient number, since it is larger than the sum of its proper divisors (1).
22022121121103 is an equidigital number, since it uses as much as digits as its factorization.
22022121121103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 22022121121103 its reverse (30112112122022), we get a palindrome (52134233243125).
The spelling of 22022121121103 in words is "twenty-two trillion, twenty-two billion, one hundred twenty-one million, one hundred twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •