Base | Representation |
---|---|
bin | 1001001100001111110100… |
… | …11001001001000001001101 |
3 | 2122120020202120022012022102 |
4 | 10212013322121021001031 |
5 | 10122123210114202341 |
6 | 110553135201524445 |
7 | 4154161514333231 |
oct | 446077231110115 |
9 | 78506676265272 |
10 | 20212022022221 |
11 | 6492963561497 |
12 | 2325285343725 |
13 | b37ca71a8413 |
14 | 4dc3a4c505c1 |
15 | 250b6397ac9b |
hex | 1261fa64904d |
20212022022221 has 2 divisors, whose sum is σ = 20212022022222. Its totient is φ = 20212022022220.
The previous prime is 20212022022169. The next prime is 20212022022229. The reversal of 20212022022221 is 12222022021202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18218811722500 + 1993210299721 = 4268350^2 + 1411811^2 .
It is a cyclic number.
It is not a de Polignac number, because 20212022022221 - 222 = 20212017827917 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20212022022193 and 20212022022202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20212022022229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10106011011110 + 10106011011111.
It is an arithmetic number, because the mean of its divisors is an integer number (10106011011111).
Almost surely, 220212022022221 is an apocalyptic number.
It is an amenable number.
20212022022221 is a deficient number, since it is larger than the sum of its proper divisors (1).
20212022022221 is an equidigital number, since it uses as much as digits as its factorization.
20212022022221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 512, while the sum is 20.
Adding to 20212022022221 its reverse (12222022021202), we get a palindrome (32434044043423).
The spelling of 20212022022221 in words is "twenty trillion, two hundred twelve billion, twenty-two million, twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •