Base | Representation |
---|---|
bin | 101101101110011010110101… |
… | …111011111001001101000011 |
3 | 222101001011102220221210212112 |
4 | 231232122311323321031003 |
5 | 202324323404321011321 |
6 | 1551412553304045535 |
7 | 60234066210226241 |
oct | 5556326573711503 |
9 | 871034386853775 |
10 | 201102011110211 |
11 | 5909397a60a1a2 |
12 | 1a67ab007638ab |
13 | 8829ab89014a3 |
14 | 3793564239791 |
15 | 183b1d1399a5b |
hex | b6e6b5ef9343 |
201102011110211 has 4 divisors (see below), whose sum is σ = 201103575468072. Its totient is φ = 201100446752352.
The previous prime is 201102011110157. The next prime is 201102011110223. The reversal of 201102011110211 is 112011110201102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 201102011110211 - 226 = 201101944001347 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201102011110241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 781986086 + ... + 782243211.
It is an arithmetic number, because the mean of its divisors is an integer number (50275893867018).
Almost surely, 2201102011110211 is an apocalyptic number.
201102011110211 is a deficient number, since it is larger than the sum of its proper divisors (1564357861).
201102011110211 is a wasteful number, since it uses less digits than its factorization.
201102011110211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1564357860.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 201102011110211 its reverse (112011110201102), we get a palindrome (313113121311313).
The spelling of 201102011110211 in words is "two hundred one trillion, one hundred two billion, eleven million, one hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •