Base | Representation |
---|---|
bin | 1010000110001110100101… |
… | …1000100100000000000110 |
3 | 1110022100111012120002212020 |
4 | 2201203221120210000012 |
5 | 2423344110410214420 |
6 | 35340123413104010 |
7 | 2224046442436212 |
oct | 241435130440006 |
9 | 43270435502766 |
10 | 11102111023110 |
11 | 35a0419271a08 |
12 | 12b37b6628006 |
13 | 626c033b0aa3 |
14 | 2a54b8b11942 |
15 | 143bd0dd7340 |
hex | a18e9624006 |
11102111023110 has 64 divisors (see below), whose sum is σ = 27666330321600. Its totient is φ = 2847848202752.
The previous prime is 11102111023109. The next prime is 11102111023121. The reversal of 11102111023110 is 1132011120111.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11102111023110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 23485389 + ... + 23953448.
It is an arithmetic number, because the mean of its divisors is an integer number (432286411275).
Almost surely, 211102111023110 is an apocalyptic number.
11102111023110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11102111023110 is an abundant number, since it is smaller than the sum of its proper divisors (16564219298490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11102111023110 is a wasteful number, since it uses less digits than its factorization.
11102111023110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47439145.
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 11102111023110 its reverse (1132011120111), we get a palindrome (12234122143221).
The spelling of 11102111023110 in words is "eleven trillion, one hundred two billion, one hundred eleven million, twenty-three thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •