Base | Representation |
---|---|
bin | 101101011110011001011101… |
… | …001010101111001001111011 |
3 | 222020010220120021111121010002 |
4 | 231132121131022233021323 |
5 | 202203304032102414321 |
6 | 1545211110133343215 |
7 | 60061411323013532 |
oct | 5536313512571173 |
9 | 866126507447102 |
10 | 200001010201211 |
11 | 587a9a5227448a |
12 | 1a521651797b0b |
13 | 877a02565b38b |
14 | 3756159c69319 |
15 | 181c742ad820b |
hex | b5e65d2af27b |
200001010201211 has 16 divisors (see below), whose sum is σ = 204001172200800. Its totient is φ = 196021625614848.
The previous prime is 200001010201117. The next prime is 200001010201231. The reversal of 200001010201211 is 112102010100002.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200001010201211 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200001010201192 and 200001010201201.
It is not an unprimeable number, because it can be changed into a prime (200001010201231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 51677075 + ... + 55412291.
It is an arithmetic number, because the mean of its divisors is an integer number (12750073262550).
Almost surely, 2200001010201211 is an apocalyptic number.
200001010201211 is a deficient number, since it is larger than the sum of its proper divisors (4000161999589).
200001010201211 is a wasteful number, since it uses less digits than its factorization.
200001010201211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3737998.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 200001010201211 its reverse (112102010100002), we get a palindrome (312103020301213).
The spelling of 200001010201211 in words is "two hundred trillion, one billion, ten million, two hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •