Base | Representation |
---|---|
bin | 11101010010000000100… |
… | …010011010101001010101 |
3 | 21010100211202120001010021 |
4 | 131102000202122221111 |
5 | 230431442001401323 |
6 | 4140220435025141 |
7 | 265243135665241 |
oct | 35220042325125 |
9 | 7110752501107 |
10 | 2012201200213 |
11 | 706408135126 |
12 | 285b8a13b1b1 |
13 | 1179992b3579 |
14 | 6d5690c3421 |
15 | 3751e24305d |
hex | 1d48089aa55 |
2012201200213 has 16 divisors (see below), whose sum is σ = 2134726912000. Its totient is φ = 1891368241200.
The previous prime is 2012201200199. The next prime is 2012201200223. The reversal of 2012201200213 is 3120021022102.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2012201200213 is a prime.
It is a super-2 number, since 2×20122012002132 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2012201200223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1935088 + ... + 2787286.
It is an arithmetic number, because the mean of its divisors is an integer number (133420432000).
Almost surely, 22012201200213 is an apocalyptic number.
It is an amenable number.
2012201200213 is a deficient number, since it is larger than the sum of its proper divisors (122525711787).
2012201200213 is a wasteful number, since it uses less digits than its factorization.
2012201200213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 853192.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 2012201200213 its reverse (3120021022102), we get a palindrome (5132222222315).
The spelling of 2012201200213 in words is "two trillion, twelve billion, two hundred one million, two hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •