Search a number
-
+
110111111100100 = 225211412719919091
BaseRepresentation
bin11001000010010100111101…
…101010011011011011000100
3112102212112000122200111021201
4121002110331222123123010
5103413030023420200400
61030104202432152244
732123156660344105
oct3102247552333304
9472775018614251
10110111111100100
11320a2950697250
1210424330398684
134959582a37536
141d295989123ac
15cae39913506a
hex64253da9b6c4

110111111100100 has 288 divisors, whose sum is σ = 268305931321344. Its totient is φ = 38876112000000.

The previous prime is 110111111100097. The next prime is 110111111100101. The reversal of 110111111100100 is 1001111111011.

It is a happy number.

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

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

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 95 ways as a sum of consecutive naturals, for example, 12112096555 + ... + 12112105645.

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

Almost surely, 2110111111100100 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

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

Adding to 110111111100100 its reverse (1001111111011), we get a palindrome (111112222211111).

It can be divided in two parts, 11011 and 1111100100, that added together give a palindrome (1111111111).

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