Search a number
-
+
110001011101110 = 232517323372411213
BaseRepresentation
bin11001000000101110011011…
…001100010000110110110110
3112102110222211121010001002100
4121000232123030100312312
5103404224032320213420
61025541433351122530
732112211412654313
oct3100563314206666
9472428747101070
10110001011101110
1132060192056448
1210406b24073446
13494c0878c743c
141d2411233bd0a
15cab5a3388190
hex640b9b310db6

110001011101110 has 768 divisors, whose sum is σ = 327276823610880. Its totient is φ = 25566313512960.

The previous prime is 110001011101097. The next prime is 110001011101117. The reversal of 110001011101110 is 11101110100011.

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

110001011101110 is a modest number, since divided by 11101110 gives 1100010 as remainder.

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

It is a congruent number.

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

It is a polite number, since it can be written in 383 ways as a sum of consecutive naturals, for example, 90685086864 + ... + 90685088076.

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

Almost surely, 2110001011101110 is an apocalyptic number.

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

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

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

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

110001011101110 is an evil number, because the sum of its binary digits is even.

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

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

Adding to 110001011101110 its reverse (11101110100011), we get a palindrome (121102121201121).

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