Base | Representation |
---|---|
bin | 1001000110101010010110… |
… | …00000101000000101000101 |
3 | 2121212220101021002020001211 |
4 | 10203111023000220011011 |
5 | 10111002131330201041 |
6 | 110325035112451421 |
7 | 4134255523625422 |
oct | 443251300500505 |
9 | 77786337066054 |
10 | 20020101022021 |
11 | 6419528116431 |
12 | 22b40433a9b71 |
13 | b22b6c89c3c9 |
14 | 4d2d99b1cd49 |
15 | 24ab7e909481 |
hex | 12354b028145 |
20020101022021 has 2 divisors, whose sum is σ = 20020101022022. Its totient is φ = 20020101022020.
The previous prime is 20020101021937. The next prime is 20020101022069. The reversal of 20020101022021 is 12022010102002.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18557476849921 + 1462624172100 = 4307839^2 + 1209390^2 .
It is a cyclic number.
It is not a de Polignac number, because 20020101022021 - 233 = 20011511087429 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20020101021992 and 20020101022010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20020101022081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10010050511010 + 10010050511011.
It is an arithmetic number, because the mean of its divisors is an integer number (10010050511011).
Almost surely, 220020101022021 is an apocalyptic number.
It is an amenable number.
20020101022021 is a deficient number, since it is larger than the sum of its proper divisors (1).
20020101022021 is an equidigital number, since it uses as much as digits as its factorization.
20020101022021 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 13.
Adding to 20020101022021 its reverse (12022010102002), we get a palindrome (32042111124023).
The spelling of 20020101022021 in words is "twenty trillion, twenty billion, one hundred one million, twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •