Search a number
-
+
11011111000110 = 2335137993392477
BaseRepresentation
bin1010000000111011100101…
…0111000001100000101110
31102222122121020221222002000
42200032321113001200232
52420401223404000420
635230233510513130
72214345411134544
oct240167127014056
942878536858060
1011011111000110
113565871111831
12129a03a9657a6
1361b460344030
142a0d2509bd94
15141656d72690
hexa03b95c182e

11011111000110 has 128 divisors (see below), whose sum is σ = 31625688850560. Its totient is φ = 2710081317888.

The previous prime is 11011111000079. The next prime is 11011111000111. The reversal of 11011111000110 is 1100011111011.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a junction number, because it is equal to n+sod(n) for n = 11011111000092 and 11011111000101.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11011111000111) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 27859192 + ... + 28251668.

It is an arithmetic number, because the mean of its divisors is an integer number (247075694145).

Almost surely, 211011111000110 is an apocalyptic number.

11011111000110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is a practical number, because each smaller number is the sum of distinct divisors of 11011111000110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15812844425280).

11011111000110 is an abundant number, since it is smaller than the sum of its proper divisors (20614577850450).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

11011111000110 is a wasteful number, since it uses less digits than its factorization.

11011111000110 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 400499 (or 400493 counting only the distinct ones).

The product of its (nonzero) digits is 1, while the sum is 9.

Adding to 11011111000110 its reverse (1100011111011), we get a palindrome (12111122111121).

The spelling of 11011111000110 in words is "eleven trillion, eleven billion, one hundred eleven million, one hundred ten", and thus it is an aban number.

Divisors: 1 2 3 5 6 9 10 13 15 18 26 27 30 39 45 54 65 78 90 117 130 135 195 234 270 351 390 585 702 1170 1755 3510 7993 15986 23979 39965 47958 71937 79930 103909 119895 143874 207818 215811 239790 311727 359685 392477 431622 519545 623454 719370 784954 935181 1039090 1079055 1177431 1558635 1870362 1962385 2158110 2354862 2805543 3117270 3532293 3924770 4675905 5102201 5611086 5887155 7064586 9351810 10204402 10596879 11774310 14027715 15306603 17661465 21193758 25511005 28055430 30613206 35322930 45919809 51022010 52984395 76533015 91839618 105968790 137759427 153066030 229599045 275518854 459198090 688797135 1377594270 3137068661 6274137322 9411205983 15685343305 18822411966 28233617949 31370686610 40781892593 47056029915 56467235898 81563785186 84700853847 94112059830 122345677779 141168089745 169401707694 203909462965 244691355558 282336179490 367037033337 407818925930 423504269235 611728388895 734074066674 847008538470 1101111100011 1223456777790 1835185166685 2202222200022 3670370333370 5505555500055 11011111000110