Search a number
-
+
11120100210000 = 2432543133711827
BaseRepresentation
bin1010000111010001100110…
…0111110111010101010000
31110101001220220101111002100
42201310121213313111100
52424142431123210000
635352300431520400
72225254310134215
oct241643147672520
943331826344070
1011120100210000
1135a800a739311
1212b7197089100
1362880c2c6682
142a6303d25b0c
151443d5356a00
hexa1d199f7550

11120100210000 has 600 divisors, whose sum is σ = 40265590686464. Its totient is φ = 2860945920000.

The previous prime is 11120100209993. The next prime is 11120100210007. The reversal of 11120100210000 is 1200102111.

It is a happy number.

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

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

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

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11120100210007) by changing a digit.

It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 940224087 + ... + 940235913.

Almost surely, 211120100210000 is an apocalyptic number.

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

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

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

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

11120100210000 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 4, while the sum is 9.

Adding to 11120100210000 its reverse (1200102111), we get a palindrome (11121300312111).

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