Search a number
-
+
11111000020120 = 23571113972860799
BaseRepresentation
bin1010000110101111101100…
…1101011001010010011000
31110100012102200202221101201
42201223323031121102120
52424020312001120440
635344153431123544
72224512636610330
oct241537315312230
943305380687351
1011111000020120
1135a416a936a30
1212b54775135b4
136279bbb67330
142a5abd4b00c0
1514405148919a
hexa1afb359498

11111000020120 has 256 divisors, whose sum is σ = 33912152064000. Its totient is φ = 3163813724160.

The previous prime is 11111000020111. The next prime is 11111000020121. The reversal of 11111000020120 is 2102000011111.

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

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

It is a junction number, because it is equal to n+sod(n) for n = 11111000020097 and 11111000020106.

It is a congruent number.

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2453481 + ... + 5314279.

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

Almost surely, 211111000020120 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 11111000020120 its reverse (2102000011111), we get a palindrome (13213000031231).

Subtracting from 11111000020120 its reverse (2102000011111), we obtain a palindrome (9009000009009).

The spelling of 11111000020120 in words is "eleven trillion, one hundred eleven billion, twenty thousand, one hundred twenty".