Base | Representation |
---|---|
bin | 1010000000010110010010… |
… | …1110010100111100111101 |
3 | 1102221200202122120220210001 |
4 | 2200011210232110330331 |
5 | 2420220223341023401 |
6 | 35221500332114301 |
7 | 2213542353364633 |
oct | 240054456247475 |
9 | 42850678526701 |
10 | 11001101111101 |
11 | 35615a4862a92 |
12 | 1298106605991 |
13 | 61a5265a369a |
14 | 2a06558c3353 |
15 | 14126d1ae601 |
hex | a0164b94f3d |
11001101111101 has 2 divisors, whose sum is σ = 11001101111102. Its totient is φ = 11001101111100.
The previous prime is 11001101111093. The next prime is 11001101111113. The reversal of 11001101111101 is 10111110110011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6992692696900 + 4008408414201 = 2644370^2 + 2002101^2 .
It is a cyclic number.
It is not a de Polignac number, because 11001101111101 - 23 = 11001101111093 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11001101111501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500550555550 + 5500550555551.
It is an arithmetic number, because the mean of its divisors is an integer number (5500550555551).
Almost surely, 211001101111101 is an apocalyptic number.
It is an amenable number.
11001101111101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001101111101 is an equidigital number, since it uses as much as digits as its factorization.
11001101111101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1, while the sum is 10.
Adding to 11001101111101 its reverse (10111110110011), we get a palindrome (21112211221112).
The spelling of 11001101111101 in words is "eleven trillion, one billion, one hundred one million, one hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •