Search a number
-
+
110111100001110 = 2355131929655489
BaseRepresentation
bin11001000010010100111101…
…000000000101101101010110
3112102212111222212210121100000
4121002110331000011231112
5103413030013100013420
61030104201354232130
732123156464116405
oct3102247500055526
9472774885717300
10110111100001110
11320a29453a642a
1210424328725646
13495958064c6a0
141d2959726363c
15cae398191690
hex64253d005b56

110111100001110 has 288 divisors, whose sum is σ = 337443617740320. Its totient is φ = 25677727543296.

The previous prime is 110111100001081. The next prime is 110111100001117. The reversal of 110111100001110 is 11100001111011.

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 = 110111100001092 and 110111100001101.

It is a congruent number.

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

It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 6576246 + ... + 16231734.

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

Almost surely, 2110111100001110 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110111100001110 its reverse (11100001111011), we get a palindrome (121211101112121).

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