Search a number
-
+
11111000500500 = 2235320173672451
BaseRepresentation
bin1010000110101111101100…
…1111001110100100010100
31110100012102201200100100120
42201223323033032210110
52424020312112004000
635344153445311540
72224512643651005
oct241537317164424
943305381610316
1011111000500500
1135a417013493a
1212b54777055b0
136279bbca4b94
142a5abd5971ac
151440515316a0
hexa1afb3ce914

11111000500500 has 96 divisors (see below), whose sum is σ = 32371283538048. Its totient is φ = 2961463680000.

The previous prime is 11111000500429. The next prime is 11111000500507. The reversal of 11111000500500 is 500500011111.

It is a super-2 number, since 2×111110005005002 (a number of 27 digits) contains 22 as substring.

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

It is a self number, because there is not a number n which added to its sum of digits gives 11111000500500.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11111000500507) 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 31 ways as a sum of consecutive naturals, for example, 1189275 + ... + 4861725.

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

Almost surely, 211111000500500 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 25, while the sum is 15.

Adding to 11111000500500 its reverse (500500011111), we get a palindrome (11611500511611).

The spelling of 11111000500500 in words is "eleven trillion, one hundred eleven billion, five hundred thousand, five hundred".

Divisors: 1 2 3 4 5 6 10 12 15 20 25 30 50 60 75 100 125 150 250 300 375 500 750 1500 2017 4034 6051 8068 10085 12102 20170 24204 30255 40340 50425 60510 100850 121020 151275 201700 252125 302550 504250 605100 756375 1008500 1512750 3025500 3672451 7344902 11017353 14689804 18362255 22034706 36724510 44069412 55086765 73449020 91811275 110173530 183622550 220347060 275433825 367245100 459056375 550867650 918112750 1101735300 1377169125 1836225500 2754338250 5508676500 7407333667 14814667334 22222001001 29629334668 37036668335 44444002002 74073336670 88888004004 111110005005 148146673340 185183341675 222220010010 370366683350 444440020020 555550025025 740733366700 925916708375 1111100050050 1851833416750 2222200100100 2777750125125 3703666833500 5555500250250 11111000500500