Base | Representation |
---|---|
bin | 1010000110001110100011… |
… | …0110001011100011111110 |
3 | 1110022100110120121012100102 |
4 | 2201203220312023203332 |
5 | 2423344101103310420 |
6 | 35340122452001102 |
7 | 2224046303020226 |
oct | 241435066134376 |
9 | 43270416535312 |
10 | 11102102010110 |
11 | 35a0414176351 |
12 | 12b37b3600192 |
13 | 626c01576557 |
14 | 2a54b7847086 |
15 | 143bd0206a75 |
hex | a18e8d8b8fe |
11102102010110 has 32 divisors (see below), whose sum is σ = 20087361800352. Its totient is φ = 4417878965760.
The previous prime is 11102102010061. The next prime is 11102102010121. The reversal of 11102102010110 is 1101020120111.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11102102010091 and 11102102010100.
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, 1871087 + ... + 5070026.
It is an arithmetic number, because the mean of its divisors is an integer number (627730056261).
Almost surely, 211102102010110 is an apocalyptic number.
11102102010110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11102102010110 is a deficient number, since it is larger than the sum of its proper divisors (8985259790242).
11102102010110 is a wasteful number, since it uses less digits than its factorization.
11102102010110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6941948.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11102102010110 its reverse (1101020120111), we get a palindrome (12203122130221).
The spelling of 11102102010110 in words is "eleven trillion, one hundred two billion, one hundred two million, ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •