Base | Representation |
---|---|
bin | 1001001100011110101100… |
… | …00010010101110101011101 |
3 | 2122121000100201001002012011 |
4 | 10212033112002111311131 |
5 | 10122241031003001341 |
6 | 111000535104311221 |
7 | 4154563333123222 |
oct | 446172602256535 |
9 | 78530321032164 |
10 | 20220002000221 |
11 | 6496288aa4031 |
12 | 2326931912511 |
13 | b3897952b0aa |
14 | 4dc9209c5949 |
15 | 250e7e31db81 |
hex | 1263d6095d5d |
20220002000221 has 2 divisors, whose sum is σ = 20220002000222. Its totient is φ = 20220002000220.
The previous prime is 20220002000197. The next prime is 20220002000243. The reversal of 20220002000221 is 12200020002202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11172774204900 + 9047227795321 = 3342570^2 + 3007861^2 .
It is a cyclic number.
It is not a de Polignac number, because 20220002000221 - 215 = 20220001967453 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20220002000281) 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, 10110001000110 + 10110001000111.
It is an arithmetic number, because the mean of its divisors is an integer number (10110001000111).
Almost surely, 220220002000221 is an apocalyptic number.
It is an amenable number.
20220002000221 is a deficient number, since it is larger than the sum of its proper divisors (1).
20220002000221 is an equidigital number, since it uses as much as digits as its factorization.
20220002000221 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 20220002000221 its reverse (12200020002202), we get a palindrome (32420022002423).
The spelling of 20220002000221 in words is "twenty trillion, two hundred twenty billion, two million, two hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •