Base | Representation |
---|---|
bin | 11110110111011100100… |
… | …111111001010111001101 |
3 | 21111202222112002202201202 |
4 | 132313130213321113031 |
5 | 234223023300314041 |
6 | 4302232413515245 |
7 | 306150224156240 |
oct | 36673447712715 |
9 | 7452875082652 |
10 | 2121120323021 |
11 | 7486201411a7 |
12 | 2a3106aa2b25 |
13 | 12503689686b |
14 | 7493c905257 |
15 | 3a2964d0a9b |
hex | 1eddc9f95cd |
2121120323021 has 16 divisors (see below), whose sum is σ = 2460215493120. Its totient is φ = 1791244344240.
The previous prime is 2121120322999. The next prime is 2121120323149. The reversal of 2121120323021 is 1203230211212.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2121120323021 is a prime.
It is a super-2 number, since 2×21211203230212 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2121120322984 and 2121120323002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2121120323321) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8193071 + ... + 8447996.
It is an arithmetic number, because the mean of its divisors is an integer number (153763468320).
Almost surely, 22121120323021 is an apocalyptic number.
It is an amenable number.
2121120323021 is a deficient number, since it is larger than the sum of its proper divisors (339095170099).
2121120323021 is a wasteful number, since it uses less digits than its factorization.
2121120323021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16641344.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 2121120323021 its reverse (1203230211212), we get a palindrome (3324350534233).
The spelling of 2121120323021 in words is "two trillion, one hundred twenty-one billion, one hundred twenty million, three hundred twenty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •