Base | Representation |
---|---|
bin | 1001001100100000100101… |
… | …01101101101011011100101 |
3 | 2122121002222122120221010112 |
4 | 10212100102231231123211 |
5 | 10122300122110031041 |
6 | 111001224111502405 |
7 | 4154630504031416 |
oct | 446202255553345 |
9 | 78532878527115 |
10 | 20221020002021 |
11 | 64967606a2933 |
12 | 2326b76827a05 |
13 | b38aac3cc017 |
14 | 4dc9b9c9b80d |
15 | 250edd8a8deb |
hex | 126412b6d6e5 |
20221020002021 has 2 divisors, whose sum is σ = 20221020002022. Its totient is φ = 20221020002020.
The previous prime is 20221020001981. The next prime is 20221020002111. The reversal of 20221020002021 is 12020002012202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16707697125025 + 3513322876996 = 4087505^2 + 1874386^2 .
It is a cyclic number.
It is not a de Polignac number, because 20221020002021 - 226 = 20220952893157 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20221020001987 and 20221020002005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20221020032021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10110510001010 + 10110510001011.
It is an arithmetic number, because the mean of its divisors is an integer number (10110510001011).
Almost surely, 220221020002021 is an apocalyptic number.
It is an amenable number.
20221020002021 is a deficient number, since it is larger than the sum of its proper divisors (1).
20221020002021 is an equidigital number, since it uses as much as digits as its factorization.
20221020002021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 20221020002021 its reverse (12020002012202), we get a palindrome (32241022014223).
The spelling of 20221020002021 in words is "twenty trillion, two hundred twenty-one billion, twenty million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •