Base | Representation |
---|---|
bin | 101101100001011110000011… |
… | …001110110100001011110101 |
3 | 222020220002102122100022100021 |
4 | 231201132003032310023311 |
5 | 202220233341130431401 |
6 | 1545452100415445141 |
7 | 60112563351301543 |
oct | 5541360316641365 |
9 | 866802378308307 |
10 | 200212102202101 |
11 | 588805261a1070 |
12 | 1a556543b267b1 |
13 | 8793bc6977792 |
14 | 3762463128d93 |
15 | 1822e99c212a1 |
hex | b617833b42f5 |
200212102202101 has 32 divisors (see below), whose sum is σ = 228074867308800. Its totient is φ = 173971129812480.
The previous prime is 200212102202093. The next prime is 200212102202141. The reversal of 200212102202101 is 101202201212002.
It is a happy number.
It is not a de Polignac number, because 200212102202101 - 23 = 200212102202093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200212102202141) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4120498915 + ... + 4120547503.
It is an arithmetic number, because the mean of its divisors is an integer number (7127339603400).
Almost surely, 2200212102202101 is an apocalyptic number.
It is an amenable number.
200212102202101 is a deficient number, since it is larger than the sum of its proper divisors (27862765106699).
200212102202101 is a wasteful number, since it uses less digits than its factorization.
200212102202101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60109.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 200212102202101 its reverse (101202201212002), we get a palindrome (301414303414103).
Subtracting from 200212102202101 its reverse (101202201212002), we obtain a palindrome (99009900990099).
The spelling of 200212102202101 in words is "two hundred trillion, two hundred twelve billion, one hundred two million, two hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •