Base | Representation |
---|---|
bin | 101101101111110110000111… |
… | …001100001100100000000011 |
3 | 222101101112101201020012220212 |
4 | 231233312013030030200003 |
5 | 202332430110320232321 |
6 | 1551530001544024335 |
7 | 60244135560350522 |
oct | 5557660714144003 |
9 | 871345351205825 |
10 | 201200011102211 |
11 | 59121499aa2720 |
12 | 1a695ab07620ab |
13 | 8836105c63034 |
14 | 37981bd7dc4b9 |
15 | 183da19c1e55b |
hex | b6fd8730c803 |
201200011102211 has 32 divisors (see below), whose sum is σ = 227056870656000. Its totient is φ = 176629665369600.
The previous prime is 201200011102171. The next prime is 201200011102217. The reversal of 201200011102211 is 112201110002102.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201200011102211 is a prime.
It is not an unprimeable number, because it can be changed into a prime (201200011102217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 527570651 + ... + 527951883.
It is an arithmetic number, because the mean of its divisors is an integer number (7095527208000).
Almost surely, 2201200011102211 is an apocalyptic number.
201200011102211 is a deficient number, since it is larger than the sum of its proper divisors (25856859553789).
201200011102211 is a wasteful number, since it uses less digits than its factorization.
201200011102211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 384587.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 201200011102211 its reverse (112201110002102), we get a palindrome (313401121104313).
It can be divided in two parts, 20120001 and 1102211, that added together give a palindrome (21222212).
The spelling of 201200011102211 in words is "two hundred one trillion, two hundred billion, eleven million, one hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •