Base | Representation |
---|---|
bin | 11101010001110101101… |
… | …111100111011101100001 |
3 | 21010100101010210202200211 |
4 | 131101311233213131201 |
5 | 230431104122024301 |
6 | 4140150445414121 |
7 | 265235506523032 |
oct | 35216557473541 |
9 | 7110333722624 |
10 | 2012020111201 |
11 | 706324999291 |
12 | 285b3956a341 |
13 | 11796a91aac9 |
14 | 6d54d024a89 |
15 | 3750d3c2051 |
hex | 1d475be7761 |
2012020111201 has 4 divisors (see below), whose sum is σ = 2012040327600. Its totient is φ = 2011999894804.
The previous prime is 2012020111193. The next prime is 2012020111217. The reversal of 2012020111201 is 1021110202102.
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 2012020111201 - 23 = 2012020111193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2012020111501) 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, 9958171 + ... + 10158208.
It is an arithmetic number, because the mean of its divisors is an integer number (503010081900).
Almost surely, 22012020111201 is an apocalyptic number.
It is an amenable number.
2012020111201 is a deficient number, since it is larger than the sum of its proper divisors (20216399).
2012020111201 is a wasteful number, since it uses less digits than its factorization.
2012020111201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20216398.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2012020111201 its reverse (1021110202102), we get a palindrome (3033130313303).
Subtracting from 2012020111201 its reverse (1021110202102), we obtain a palindrome (990909909099).
The spelling of 2012020111201 in words is "two trillion, twelve billion, twenty million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •