Base | Representation |
---|---|
bin | 1011101101100010100… |
… | …1110001000101001011 |
3 | 201020100012112211121202 |
4 | 2323120221301011023 |
5 | 11244031022320321 |
6 | 232233113254415 |
7 | 20352002012642 |
oct | 2733051610513 |
9 | 636305484552 |
10 | 201203323211 |
11 | 7836a0377a0 |
12 | 32bb270440b |
13 | 15c86708147 |
14 | 9a49c38359 |
15 | 5378e1970b |
hex | 2ed8a7114b |
201203323211 has 64 divisors (see below), whose sum is σ = 235120803840. Its totient is φ = 170501760000.
The previous prime is 201203323159. The next prime is 201203323291. The reversal of 201203323211 is 112323302102.
201203323211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-201203323211 is a prime.
It is a super-3 number, since 3×2012033232113 (a number of 35 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201203323291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 198620741 + ... + 198621753.
It is an arithmetic number, because the mean of its divisors is an integer number (3673762560).
Almost surely, 2201203323211 is an apocalyptic number.
201203323211 is a deficient number, since it is larger than the sum of its proper divisors (33917480629).
201203323211 is a wasteful number, since it uses less digits than its factorization.
201203323211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1308.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 201203323211 its reverse (112323302102), we get a palindrome (313526625313).
The spelling of 201203323211 in words is "two hundred one billion, two hundred three million, three hundred twenty-three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •