Base | Representation |
---|---|
bin | 1010000000010110010010… |
… | …1110010010100000101110 |
3 | 1102221200202122120102001201 |
4 | 2200011210232102200232 |
5 | 2420220223340213402 |
6 | 35221500332000114 |
7 | 2213542353323530 |
oct | 240054456224056 |
9 | 42850678512051 |
10 | 11001101101102 |
11 | 35615a4856522 |
12 | 129810660003a |
13 | 61a52659bc78 |
14 | 2a06558bd850 |
15 | 14126d1ab687 |
hex | a0164b9282e |
11001101101102 has 16 divisors (see below), whose sum is σ = 18887648123520. Its totient is φ = 4707603198648.
The previous prime is 11001101101093. The next prime is 11001101101117. The reversal of 11001101101102 is 20110110110011.
It is a super-2 number, since 2×110011011011022 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 596191788 + ... + 596210239.
It is an arithmetic number, because the mean of its divisors is an integer number (1180478007720).
Almost surely, 211001101101102 is an apocalyptic number.
11001101101102 is a deficient number, since it is larger than the sum of its proper divisors (7886547022418).
11001101101102 is a wasteful number, since it uses less digits than its factorization.
11001101101102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1192402695.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 11001101101102 its reverse (20110110110011), we get a palindrome (31111211211113).
The spelling of 11001101101102 in words is "eleven trillion, one billion, one hundred one million, one hundred one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •