Base | Representation |
---|---|
bin | 1001001100011110101110… |
… | …01011001100111001011001 |
3 | 2122121000102000222110022212 |
4 | 10212033113023030321121 |
5 | 10122241100400200441 |
6 | 111000541025524505 |
7 | 4154563654353113 |
oct | 446172713147131 |
9 | 78530360873285 |
10 | 20220021100121 |
11 | 649629885a077 |
12 | 23269381a3735 |
13 | b389804878cb |
14 | 4dc9233583b3 |
15 | 250e80d42eeb |
hex | 1263d72cce59 |
20220021100121 has 2 divisors, whose sum is σ = 20220021100122. Its totient is φ = 20220021100120.
The previous prime is 20220021100099. The next prime is 20220021100133. The reversal of 20220021100121 is 12100112002202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14845339291225 + 5374681808896 = 3852965^2 + 2318336^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20220021100121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20220021100096 and 20220021100105.
It is not a weakly prime, because it can be changed into another prime (20220021100171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10110010550060 + 10110010550061.
It is an arithmetic number, because the mean of its divisors is an integer number (10110010550061).
Almost surely, 220220021100121 is an apocalyptic number.
It is an amenable number.
20220021100121 is a deficient number, since it is larger than the sum of its proper divisors (1).
20220021100121 is an equidigital number, since it uses as much as digits as its factorization.
20220021100121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 20220021100121 its reverse (12100112002202), we get a palindrome (32320133102323).
The spelling of 20220021100121 in words is "twenty trillion, two hundred twenty billion, twenty-one million, one hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •