Base | Representation |
---|---|
bin | 101101011110100011111000… |
… | …110010110111000000011001 |
3 | 222020011222110220000100010122 |
4 | 231132203320302313000121 |
5 | 202204000002021402301 |
6 | 1545220201420123025 |
7 | 60062256022201052 |
oct | 5536437062670031 |
9 | 866158426010118 |
10 | 200012211122201 |
11 | 5880377a964185 |
12 | 1a523858996475 |
13 | 877b0bc0a328a |
14 | 37568dd6bb729 |
15 | 181cb9b11481b |
hex | b5e8f8cb7019 |
200012211122201 has 16 divisors (see below), whose sum is σ = 200846693608704. Its totient is φ = 199179218671104.
The previous prime is 200012211122197. The next prime is 200012211122231. The reversal of 200012211122201 is 102221112210002.
It is a cyclic number.
It is not a de Polignac number, because 200012211122201 - 22 = 200012211122197 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 200012211122201.
It is not an unprimeable number, because it can be changed into a prime (200012211122231) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2288870756 + ... + 2288958138.
It is an arithmetic number, because the mean of its divisors is an integer number (12552918350544).
Almost surely, 2200012211122201 is an apocalyptic number.
It is an amenable number.
200012211122201 is a deficient number, since it is larger than the sum of its proper divisors (834482486503).
200012211122201 is an equidigital number, since it uses as much as digits as its factorization.
200012211122201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95800.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 200012211122201 its reverse (102221112210002), we get a palindrome (302233323332203).
The spelling of 200012211122201 in words is "two hundred trillion, twelve billion, two hundred eleven million, one hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •