Search a number
-
+
111100010111112 = 233113767385344059
BaseRepresentation
bin11001010000101101111100…
…101000110010000010001000
3112120101001112201122020200110
4121100231330220302002020
5104030230310042023422
61032142350130034320
732254465551265551
oct3120557450620210
9476331481566613
10111100010111112
1132444282377880
1210563b147189a0
1349cb8bc1a9a29
141d613aa8bb328
15cc9e7600e60c
hex650b7ca32088

111100010111112 has 256 divisors, whose sum is σ = 315922973875200. Its totient is φ = 32258745953280.

The previous prime is 111100010111063. The next prime is 111100010111113. The reversal of 111100010111112 is 211111010001111.

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

It is not an unprimeable number, because it can be changed into a prime (111100010111113) 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, 2521596939 + ... + 2521640997.

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

Almost surely, 2111100010111112 is an apocalyptic number.

111100010111112 is a gapful number since it is divisible by the number (12) 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 111100010111112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (157961486937600).

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

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

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

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

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

The product of its (nonzero) digits is 2, while the sum is 12.

Adding to 111100010111112 its reverse (211111010001111), we get a palindrome (322211020112223).

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