Base | Representation |
---|---|
bin | 11110110111011100100… |
… | …110101010111111100101 |
3 | 21111202222111111110101212 |
4 | 132313130212222333211 |
5 | 234223023210031041 |
6 | 4302232403001205 |
7 | 306150221351336 |
oct | 36673446527745 |
9 | 7452874443355 |
10 | 2121120002021 |
11 | 74861aa42009 |
12 | 2a3106969205 |
13 | 1250367b3717 |
14 | 7493c86028d |
15 | 3a29646a8eb |
hex | 1eddc9aafe5 |
2121120002021 has 2 divisors, whose sum is σ = 2121120002022. Its totient is φ = 2121120002020.
The previous prime is 2121120002003. The next prime is 2121120002069. The reversal of 2121120002021 is 1202000211212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1488792865921 + 632327136100 = 1220161^2 + 795190^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2121120002021 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2121120001987 and 2121120002005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2121120002821) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1060560001010 + 1060560001011.
It is an arithmetic number, because the mean of its divisors is an integer number (1060560001011).
Almost surely, 22121120002021 is an apocalyptic number.
It is an amenable number.
2121120002021 is a deficient number, since it is larger than the sum of its proper divisors (1).
2121120002021 is an equidigital number, since it uses as much as digits as its factorization.
2121120002021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 2121120002021 its reverse (1202000211212), we get a palindrome (3323120213233).
The spelling of 2121120002021 in words is "two trillion, one hundred twenty-one billion, one hundred twenty million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •