Base | Representation |
---|---|
bin | 1010000000111001101011… |
… | …11011100001010110111001 |
3 | 2212222012120102211202110212 |
4 | 11000130311323201112321 |
5 | 10341243410220402134 |
6 | 114500222310120505 |
7 | 4431656626421135 |
oct | 500346573412671 |
9 | 85865512752425 |
10 | 22021202122169 |
11 | 7020159563038 |
12 | 2577a34050135 |
13 | c3978a2ab113 |
14 | 561b909163c5 |
15 | 282c4e3d8bce |
hex | 140735ee15b9 |
22021202122169 has 2 divisors, whose sum is σ = 22021202122170. Its totient is φ = 22021202122168.
The previous prime is 22021202122163. The next prime is 22021202122181. The reversal of 22021202122169 is 96122120212022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21695147418025 + 326054704144 = 4657805^2 + 571012^2 .
It is a cyclic number.
It is not a de Polignac number, because 22021202122169 - 28 = 22021202121913 is a prime.
It is a super-2 number, since 2×220212021221692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (22021202122163) 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, 11010601061084 + 11010601061085.
It is an arithmetic number, because the mean of its divisors is an integer number (11010601061085).
Almost surely, 222021202122169 is an apocalyptic number.
It is an amenable number.
22021202122169 is a deficient number, since it is larger than the sum of its proper divisors (1).
22021202122169 is an equidigital number, since it uses as much as digits as its factorization.
22021202122169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 32.
The spelling of 22021202122169 in words is "twenty-two trillion, twenty-one billion, two hundred two million, one hundred twenty-two thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •