Base | Representation |
---|---|
bin | 101101101110101101100011… |
… | …011100100011110101110011 |
3 | 222101010002022002111210212012 |
4 | 231232231203130203311303 |
5 | 202330141031103013021 |
6 | 1551430115041353135 |
7 | 60235410115046012 |
oct | 5556554334436563 |
9 | 871102262453765 |
10 | 201122102001011 |
11 | 590a144a378884 |
12 | 1a6829890387ab |
13 | 882b96b080659 |
14 | 379450c620a79 |
15 | 183b9aa0bb35b |
hex | b6eb63723d73 |
201122102001011 has 4 divisors (see below), whose sum is σ = 201122330448192. Its totient is φ = 201121873553832.
The previous prime is 201122102000971. The next prime is 201122102001083. The reversal of 201122102001011 is 110100201221102.
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 201122102001011 - 226 = 201122034892147 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201122102081011) 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, 112897880 + ... + 114665493.
It is an arithmetic number, because the mean of its divisors is an integer number (50280582612048).
Almost surely, 2201122102001011 is an apocalyptic number.
201122102001011 is a deficient number, since it is larger than the sum of its proper divisors (228447181).
201122102001011 is an equidigital number, since it uses as much as digits as its factorization.
201122102001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228447180.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 201122102001011 its reverse (110100201221102), we get a palindrome (311222303222113).
The spelling of 201122102001011 in words is "two hundred one trillion, one hundred twenty-two billion, one hundred two million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •