Base | Representation |
---|---|
bin | 1001001100011111000101… |
… | …00000011101011001101001 |
3 | 2122121000220021201122200102 |
4 | 10212033202200131121221 |
5 | 10122241443033101441 |
6 | 111001011540515145 |
7 | 4154601453356501 |
oct | 446174240353151 |
9 | 78530807648612 |
10 | 20220211222121 |
11 | 6496386105599 |
12 | 232698b9abab5 |
13 | b389b0993a31 |
14 | 4dc9406c8a01 |
15 | 250e9289a69b |
hex | 1263e281d669 |
20220211222121 has 2 divisors, whose sum is σ = 20220211222122. Its totient is φ = 20220211222120.
The previous prime is 20220211222109. The next prime is 20220211222199. The reversal of 20220211222121 is 12122211202202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18026817640000 + 2193393582121 = 4245800^2 + 1481011^2 .
It is a cyclic number.
It is not a de Polignac number, because 20220211222121 - 214 = 20220211205737 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20220211222093 and 20220211222102.
It is not a weakly prime, because it can be changed into another prime (20220211228121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10110105611060 + 10110105611061.
It is an arithmetic number, because the mean of its divisors is an integer number (10110105611061).
Almost surely, 220220211222121 is an apocalyptic number.
It is an amenable number.
20220211222121 is a deficient number, since it is larger than the sum of its proper divisors (1).
20220211222121 is an equidigital number, since it uses as much as digits as its factorization.
20220211222121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 20220211222121 its reverse (12122211202202), we get a palindrome (32342422424323).
The spelling of 20220211222121 in words is "twenty trillion, two hundred twenty billion, two hundred eleven million, two hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •