Base | Representation |
---|---|
bin | 1010001100100100001110… |
… | …1110111001101110100110 |
3 | 1110200202112221021122000202 |
4 | 2203021003232321232212 |
5 | 2432140112224323420 |
6 | 35502132431310502 |
7 | 2234653025164115 |
oct | 243110356715646 |
9 | 43622487248022 |
10 | 11211001011110 |
11 | 363261688962a |
12 | 131092567b432 |
13 | 634267932b54 |
14 | 2aa88870bc7c |
15 | 14695581c575 |
hex | a3243bb9ba6 |
11211001011110 has 32 divisors (see below), whose sum is σ = 21414085966080. Its totient is φ = 4216724325088.
The previous prime is 11211001011109. The next prime is 11211001011139. The reversal of 11211001011110 is 1111010011211.
It is a happy number.
It is a super-2 number, since 2×112110010111102 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11211001011091 and 11211001011100.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 413066792 + ... + 413093931.
It is an arithmetic number, because the mean of its divisors is an integer number (669190186440).
Almost surely, 211211001011110 is an apocalyptic number.
11211001011110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11211001011110 is a deficient number, since it is larger than the sum of its proper divisors (10203084954970).
11211001011110 is a wasteful number, since it uses less digits than its factorization.
11211001011110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 826160812.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 11211001011110 its reverse (1111010011211), we get a palindrome (12322011022321).
The spelling of 11211001011110 in words is "eleven trillion, two hundred eleven billion, one million, eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •