Base | Representation |
---|---|
bin | 11101010010000000100… |
… | …001101010010010001001 |
3 | 21010100211202011222101112 |
4 | 131102000201222102021 |
5 | 230431441424031441 |
6 | 4140220430500105 |
7 | 265243134211562 |
oct | 35220041522211 |
9 | 7110752158345 |
10 | 2012201002121 |
11 | 70640800a312 |
12 | 285b8a064635 |
13 | 11799924435b |
14 | 6d569071169 |
15 | 3751e2044eb |
hex | 1d48086a489 |
2012201002121 has 4 divisors (see below), whose sum is σ = 2017806019200. Its totient is φ = 2006595985044.
The previous prime is 2012201002103. The next prime is 2012201002151. The reversal of 2012201002121 is 1212001022102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2012201002121 - 238 = 1737323095177 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2012201002096 and 2012201002105.
It is not an unprimeable number, because it can be changed into a prime (2012201002151) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2802508001 + ... + 2802508718.
It is an arithmetic number, because the mean of its divisors is an integer number (504451504800).
Almost surely, 22012201002121 is an apocalyptic number.
It is an amenable number.
2012201002121 is a deficient number, since it is larger than the sum of its proper divisors (5605017079).
2012201002121 is an equidigital number, since it uses as much as digits as its factorization.
2012201002121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5605017078.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 2012201002121 its reverse (1212001022102), we get a palindrome (3224202024223).
The spelling of 2012201002121 in words is "two trillion, twelve billion, two hundred one million, two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •