Cookie Consent by FreePrivacyPolicy.com
Search a number
-
+
1101011111112 = 23311109151253387
BaseRepresentation
bin10000000001011001011…
…000000100110011001000
310220020220100122112102110
4100001121120010303020
5121014332321023422
62201444133102320
7142355040013233
oct20013130046310
93806810575373
101101011111112
11394a33083810
121594724879a0
137ca95405983
143b4098a841a
151d98e62960c
hex10059604cc8

1101011111112 has 128 divisors (see below), whose sum is σ = 3050386099200. Its totient is φ = 328388256000.

The previous prime is 1101011111111. The next prime is 1101011111113. The reversal of 1101011111112 is 2111111101011.

It is an interprime number because it is at equal distance from previous prime (1101011111111) and next prime (1101011111113).

It is a super-3 number, since 3×11010111111123 (a number of 37 digits) contains 333 as substring.

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 (1101011111111) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4218483 + ... + 4471869.

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

Almost surely, 21101011111112 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 1101011111112 its reverse (2111111101011), we get a palindrome (3212122212123).

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

Divisors: 1 2 3 4 6 8 11 12 22 24 33 44 66 88 109 132 151 218 264 302 327 436 453 604 654 872 906 1199 1208 1308 1661 1812 2398 2616 3322 3597 3624 4796 4983 6644 7194 9592 9966 13288 14388 16459 19932 28776 32918 39864 49377 65836 98754 131672 181049 197508 253387 362098 395016 506774 543147 724196 760161 1013548 1086294 1448392 1520322 2027096 2172588 2787257 3040644 4345176 5574514 6081288 8361771 11149028 16723542 22298056 27619183 33447084 38261437 55238366 66894168 76522874 82857549 110476732 114784311 153045748 165715098 220953464 229568622 303811013 306091496 331430196 420875807 459137244 607622026 662860392 841751614 911433039 918274488 1215244052 1262627421 1683503228 1822866078 2430488104 2525254842 3367006456 3645732156 4170496633 5050509684 7291464312 8340993266 10101019368 12511489899 16681986532 25022979798 33363973064 45875462963 50045959596 91750925926 100091919192 137626388889 183501851852 275252777778 367003703704 550505555556 1101011111112