Base | Representation |
---|---|
bin | 10010101001011001… |
… | …111100111110000101 |
3 | 1220200100222002210011 |
4 | 102221121330332011 |
5 | 312001114201041 |
6 | 13110433230221 |
7 | 1306110244021 |
oct | 225131747605 |
9 | 56610862704 |
10 | 20022022021 |
11 | 8544a00541 |
12 | 3a69402371 |
13 | 1b71118511 |
14 | d7d1b9381 |
15 | 7c2b6ae81 |
hex | 4a967cf85 |
20022022021 has 2 divisors, whose sum is σ = 20022022022. Its totient is φ = 20022022020.
The previous prime is 20022022019. The next prime is 20022022061. The reversal of 20022022021 is 12022022002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16408329025 + 3613692996 = 128095^2 + 60114^2 .
It is a cyclic number.
It is not a de Polignac number, because 20022022021 - 21 = 20022022019 is a prime.
Together with 20022022019, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 20022021992 and 20022022010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20022022001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10011011010 + 10011011011.
It is an arithmetic number, because the mean of its divisors is an integer number (10011011011).
Almost surely, 220022022021 is an apocalyptic number.
It is an amenable number.
20022022021 is a deficient number, since it is larger than the sum of its proper divisors (1).
20022022021 is an equidigital number, since it uses as much as digits as its factorization.
20022022021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 13.
Adding to 20022022021 its reverse (12022022002), we get a palindrome (32044044023).
The spelling of 20022022021 in words is "twenty billion, twenty-two million, twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •