Base | Representation |
---|---|
bin | 1010000000010101111011… |
… | …0000011110001110111110 |
3 | 1102221200111200020021000221 |
4 | 2200011132300132032332 |
5 | 2420220022224310420 |
6 | 35221442354411554 |
7 | 2213540026502206 |
oct | 240053660361676 |
9 | 42850450207027 |
10 | 11001001010110 |
11 | 35615533026a1 |
12 | 1298098b90bba |
13 | 61a50b925c27 |
14 | 2a06464a7406 |
15 | 1412644d9caa |
hex | a015ec1e3be |
11001001010110 has 8 divisors (see below), whose sum is σ = 19801801818216. Its totient is φ = 4400400404040.
The previous prime is 11001001010107. The next prime is 11001001010123. The reversal of 11001001010110 is 1101010010011.
It is a happy number.
11001001010110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 11001001010093 and 11001001010102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 550050050496 + ... + 550050050515.
It is an arithmetic number, because the mean of its divisors is an integer number (2475225227277).
Almost surely, 211001001010110 is an apocalyptic number.
11001001010110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11001001010110 is a deficient number, since it is larger than the sum of its proper divisors (8800800808106).
11001001010110 is a wasteful number, since it uses less digits than its factorization.
11001001010110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1100100101018.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 11001001010110 its reverse (1101010010011), we get a palindrome (12102011020121).
The spelling of 11001001010110 in words is "eleven trillion, one billion, one million, ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •