Search a number
-
+
11100210000 = 243541133637
BaseRepresentation
bin10100101011001111…
…11100001101010000
31001122121000002111220
422111213330031100
5140213123210000
65033244005040
7542034141165
oct122547741520
931577002456
1011100210000
114786863080
122199530780
13107b9128c9
1477431806c
1544e7861a0
hex2959fc350

11100210000 has 200 divisors, whose sum is σ = 39091661664. Its totient is φ = 2690880000.

The previous prime is 11100209999. The next prime is 11100210013. The reversal of 11100210000 is 1200111.

11100210000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a tau number, because it is divible by the number of its divisors (200).

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 (17) of ones.

It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 313182 + ... + 346818.

Almost surely, 211100210000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 11100210000 its reverse (1200111), we get a palindrome (11101410111).

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