Base | Representation |
---|---|
bin | 1010000000010110010010… |
… | …1110010010100000101101 |
3 | 1102221200202122120102001200 |
4 | 2200011210232102200231 |
5 | 2420220223340213401 |
6 | 35221500332000113 |
7 | 2213542353323526 |
oct | 240054456224055 |
9 | 42850678512050 |
10 | 11001101101101 |
11 | 35615a4856521 |
12 | 1298106600039 |
13 | 61a52659bc77 |
14 | 2a06558bd84d |
15 | 14126d1ab686 |
hex | a0164b9282d |
11001101101101 has 48 divisors (see below), whose sum is σ = 16151716758528. Its totient is φ = 7213992710400.
The previous prime is 11001101101093. The next prime is 11001101101117. The reversal of 11001101101101 is 10110110110011.
It is not a de Polignac number, because 11001101101101 - 23 = 11001101101093 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11001101101171) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 628733385 + ... + 628750881.
It is an arithmetic number, because the mean of its divisors is an integer number (336494099136).
Almost surely, 211001101101101 is an apocalyptic number.
It is an amenable number.
11001101101101 is a deficient number, since it is larger than the sum of its proper divisors (5150615657427).
11001101101101 is a wasteful number, since it uses less digits than its factorization.
11001101101101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19802 (or 19799 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 11001101101101 its reverse (10110110110011), we get a palindrome (21111211211112).
The spelling of 11001101101101 in words is "eleven trillion, one billion, one hundred one million, one hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •