Base | Representation |
---|---|
bin | 1010000000111111010001… |
… | …0100001011111011101110 |
3 | 1102222202011012011001122210 |
4 | 2200033310110023323232 |
5 | 2420410240112041420 |
6 | 35230520002551250 |
7 | 2214412051350156 |
oct | 240176424137356 |
9 | 42882135131583 |
10 | 11012100112110 |
11 | 3566229479269 |
12 | 129a276068526 |
13 | 61b58a23b3c6 |
14 | 2a0dba5b3766 |
15 | 1416b3b029e0 |
hex | a03f450beee |
11012100112110 has 64 divisors (see below), whose sum is σ = 27986428599552. Its totient is φ = 2763550695936.
The previous prime is 11012100112087. The next prime is 11012100112121. The reversal of 11012100112110 is 1121100121011.
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 31 ways as a sum of consecutive naturals, for example, 4184629 + ... + 6287711.
It is an arithmetic number, because the mean of its divisors is an integer number (437287946868).
Almost surely, 211012100112110 is an apocalyptic number.
11012100112110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11012100112110 is an abundant number, since it is smaller than the sum of its proper divisors (16974328487442).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11012100112110 is a wasteful number, since it uses less digits than its factorization.
11012100112110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2113377.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 11012100112110 its reverse (1121100121011), we get a palindrome (12133200233121).
The spelling of 11012100112110 in words is "eleven trillion, twelve billion, one hundred million, one hundred twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •