Base | Representation |
---|---|
bin | 11101010001110100100… |
… | …110110000100111110011 |
3 | 21010100022210212102210211 |
4 | 131101310212300213303 |
5 | 230431034224342321 |
6 | 4140144524204551 |
7 | 265235155265611 |
oct | 35216446604763 |
9 | 7110283772724 |
10 | 2012001012211 |
11 | 7063151339a3 |
12 | 285b33099757 |
13 | 117966991828 |
14 | 6d54a6926b1 |
15 | 3750b89d0e1 |
hex | 1d4749b09f3 |
2012001012211 has 4 divisors (see below), whose sum is σ = 2044984635424. Its totient is φ = 1979017389000.
The previous prime is 2012001012191. The next prime is 2012001012289. The reversal of 2012001012211 is 1122101002102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2012001012211 - 213 = 2012001004019 is a prime.
It is a super-2 number, since 2×20120010122112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2012001012191 and 2012001012200.
It is not an unprimeable number, because it can be changed into a prime (2012061012211) 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, 16491811515 + ... + 16491811636.
It is an arithmetic number, because the mean of its divisors is an integer number (511246158856).
Almost surely, 22012001012211 is an apocalyptic number.
2012001012211 is a deficient number, since it is larger than the sum of its proper divisors (32983623213).
2012001012211 is an equidigital number, since it uses as much as digits as its factorization.
2012001012211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32983623212.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2012001012211 its reverse (1122101002102), we get a palindrome (3134102014313).
The spelling of 2012001012211 in words is "two trillion, twelve billion, one million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •