Base | Representation |
---|---|
bin | 101101101110101011101100… |
… | …001111111011011101110001 |
3 | 222101002220010201112110020120 |
4 | 231232223230033323131301 |
5 | 202330122432130414301 |
6 | 1551425144403000453 |
7 | 60235306423036611 |
oct | 5556535417733561 |
9 | 871086121473216 |
10 | 201120102201201 |
11 | 590a0613558667 |
12 | 1a68250b369129 |
13 | 882b70c976461 |
14 | 379439cbb8a41 |
15 | 183b8de747e36 |
hex | b6eaec3fb771 |
201120102201201 has 8 divisors (see below), whose sum is σ = 269311038141600. Its totient is φ = 133504617197472.
The previous prime is 201120102201181. The next prime is 201120102201247. The reversal of 201120102201201 is 102102201021102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201120102201201 - 213 = 201120102193009 is a prime.
It is not an unprimeable number, because it can be changed into a prime (201120102201401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 143862733351 + ... + 143862734748.
It is an arithmetic number, because the mean of its divisors is an integer number (33663879767700).
Almost surely, 2201120102201201 is an apocalyptic number.
It is an amenable number.
201120102201201 is a deficient number, since it is larger than the sum of its proper divisors (68190935940399).
201120102201201 is a wasteful number, since it uses less digits than its factorization.
201120102201201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 287725468335.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 201120102201201 its reverse (102102201021102), we get a palindrome (303222303222303).
The spelling of 201120102201201 in words is "two hundred one trillion, one hundred twenty billion, one hundred two million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •