Search a number
-
+
110010011110110 = 23453167547711939
BaseRepresentation
bin11001000000110110110011…
…101000100100101011011110
3112102111212001211012212110000
4121000312303220210223132
5103404401000321010420
61025545522412355130
732112650425533516
oct3100666350445336
9472455054185400
10110010011110110
1132063a90353411
1210408816175aa6
13494cb9037b857
141d24727756846
15cab92d567690
hex640db3a24ade

110010011110110 has 320 divisors, whose sum is σ = 309986743080960. Its totient is φ = 27958505667840.

The previous prime is 110010011110081. The next prime is 110010011110147. The reversal of 110010011110110 is 11011110010011.

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 = 110010011110092 and 110010011110101.

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 159 ways as a sum of consecutive naturals, for example, 9214334521 + ... + 9214346459.

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

Almost surely, 2110010011110110 is an apocalyptic number.

110010011110110 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 110010011110110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (154993371540480).

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

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

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

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

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

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

Adding to 110010011110110 its reverse (11011110010011), we get a palindrome (121021121120121).

The spelling of 110010011110110 in words is "one hundred ten trillion, ten billion, eleven million, one hundred ten thousand, one hundred ten".