Base | Representation |
---|---|
bin | 11110110111011100100… |
… | …111100000101100110001 |
3 | 21111202222111220122011021 |
4 | 132313130213200230301 |
5 | 234223023234101001 |
6 | 4302232411415441 |
7 | 306150223255564 |
oct | 36673447405461 |
9 | 7452874818137 |
10 | 2121120222001 |
11 | 748620082310 |
12 | 2a3106a54581 |
13 | 12503685c8a1 |
14 | 7493c8ba4db |
15 | 3a2964b0ba1 |
hex | 1eddc9e0b31 |
2121120222001 has 8 divisors (see below), whose sum is σ = 2370387122208. Its totient is φ = 1881259620000.
The previous prime is 2121120221953. The next prime is 2121120222019. The reversal of 2121120222001 is 1002220211212.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2121120222001 - 221 = 2121118124849 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2121120222061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2351574075 + ... + 2351574976.
It is an arithmetic number, because the mean of its divisors is an integer number (296298390276).
Almost surely, 22121120222001 is an apocalyptic number.
It is an amenable number.
2121120222001 is a deficient number, since it is larger than the sum of its proper divisors (249266900207).
2121120222001 is a wasteful number, since it uses less digits than its factorization.
2121120222001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4703149103.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 2121120222001 its reverse (1002220211212), we get a palindrome (3123340433213).
The spelling of 2121120222001 in words is "two trillion, one hundred twenty-one billion, one hundred twenty million, two hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •