Base | Representation |
---|---|
bin | 101101101110011010000110… |
… | …001100101011000001011001 |
3 | 222101001002101002220110121220 |
4 | 231232122012030223001121 |
5 | 202324320234302432301 |
6 | 1551412342013522253 |
7 | 60234040313511411 |
oct | 5556320614530131 |
9 | 871032332813556 |
10 | 201101210202201 |
11 | 590935a9509151 |
12 | 1a67a9184a3389 |
13 | 88299bb9c121a |
14 | 37934c9b15641 |
15 | 183b185de3936 |
hex | b6e68632b059 |
201101210202201 has 8 divisors (see below), whose sum is σ = 268466386923360. Its totient is φ = 133901753474592.
The previous prime is 201101210202121. The next prime is 201101210202227. The reversal of 201101210202201 is 102202012101102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201101210202201 - 214 = 201101210185817 is a prime.
It is not an unprimeable number, because it can be changed into a prime (201101210202271) 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 7 ways as a sum of consecutive naturals, for example, 41429995555 + ... + 41430000408.
It is an arithmetic number, because the mean of its divisors is an integer number (33558298365420).
Almost surely, 2201101210202201 is an apocalyptic number.
It is an amenable number.
201101210202201 is a deficient number, since it is larger than the sum of its proper divisors (67365176721159).
201101210202201 is an equidigital number, since it uses as much as digits as its factorization.
201101210202201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82859996775.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 201101210202201 its reverse (102202012101102), we get a palindrome (303303222303303).
The spelling of 201101210202201 in words is "two hundred one trillion, one hundred one billion, two hundred ten million, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •