Search a number
-
+
10111110000000 = 273574771101
BaseRepresentation
bin1001001100100010110100…
…0111101010110110000000
31022210121112122022001221120
42103020231013222312000
52311130023130000000
633300551345552240
72062334505640332
oct223105507526600
938717478261846
1010111110000000
113249108aa95a9
121173726345680
135846205c7959
1426d5478d5452
1512802e6e96a0
hex9322d1ead80

10111110000000 has 1024 divisors, whose sum is σ = 35113410109440. Its totient is φ = 2576000000000.

The previous prime is 10111109999909. The next prime is 10111110000059. The reversal of 10111110000000 is 1111101.

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

It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.

It is a congruent number.

It is an unprimeable number.

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 127 ways as a sum of consecutive naturals, for example, 100109999950 + ... + 100110000050.

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

Almost surely, 210111110000000 is an apocalyptic number.

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

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

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

10111110000000 is an frugal number, since it uses more digits than its factorization.

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

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

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

Adding to 10111110000000 its reverse (1111101), we get a palindrome (10111111111101).

The spelling of 10111110000000 in words is "ten trillion, one hundred eleven billion, one hundred ten million", and thus it is an aban number.