Base | Representation |
---|---|
bin | 1010000000010101111101… |
… | …0011001001011110001110 |
3 | 1102221200112022100002011121 |
4 | 2200011133103021132032 |
5 | 2420220032041200420 |
6 | 35221443321311154 |
7 | 2213540166661522 |
oct | 240053723113616 |
9 | 42850468302147 |
10 | 11001010100110 |
11 | 3561558451098 |
12 | 12980a00354ba |
13 | 61a510789524 |
14 | 2a0647791d82 |
15 | 1412651d32aa |
hex | a015f4c978e |
11001010100110 has 8 divisors (see below), whose sum is σ = 19801818180216. Its totient is φ = 4400404040040.
The previous prime is 11001010100089. The next prime is 11001010100161. The reversal of 11001010100110 is 1100101010011.
It is a happy number.
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 = 11001010100093 and 11001010100102.
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, 550050504996 + ... + 550050505015.
It is an arithmetic number, because the mean of its divisors is an integer number (2475227272527).
Almost surely, 211001010100110 is an apocalyptic number.
11001010100110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11001010100110 is a deficient number, since it is larger than the sum of its proper divisors (8800808080106).
11001010100110 is a wasteful number, since it uses less digits than its factorization.
11001010100110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1100101010018.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 11001010100110 its reverse (1100101010011), we get a palindrome (12101111110121).
Subtracting from 11001010100110 its reverse (1100101010011), we obtain a palindrome (9900909090099).
The spelling of 11001010100110 in words is "eleven trillion, one billion, ten million, one hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •