Search a number
-
+
2011110111000 = 2332531462715277
BaseRepresentation
bin11101010000111111100…
…000001111011100011000
321010021000201110222002200
4131100333200033130120
5230422223142023000
64135520301130200
7265204116614154
oct35207740173430
97107021428080
102011110111000
117059a8256701
12285924859960
13117854232753
146d4a4224064
15374a856c500
hex1d43f80f718

2011110111000 has 192 divisors, whose sum is σ = 6798461885280. Its totient is φ = 536224262400.

The previous prime is 2011110110981. The next prime is 2011110111037. The reversal of 2011110111000 is 1110111102.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 131635362 + ... + 131650638.

Almost surely, 22011110111000 is an apocalyptic number.

2011110111000 is a gapful number since it is divisible by the number (20) 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 2011110111000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3399230942640).

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

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

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

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

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

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

Adding to 2011110111000 its reverse (1110111102), we get a palindrome (2012220222102).

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