Search a number
-
+
11021112000 = 263253153071
BaseRepresentation
bin10100100001110100…
…01101001011000000
31001110002011111110100
422100322031023000
5140032401041000
65021340402400
7540053622603
oct122072151300
931402144410
1011021112000
114746148628
122176b46400
131068409c62
14767a0833a
1544785ea00
hex290e8d2c0

11021112000 has 168 divisors, whose sum is σ = 39424612032. Its totient is φ = 2938944000.

The previous prime is 11021111903. The next prime is 11021112043. The reversal of 11021112000 is 21112011.

It is a happy number.

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

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4536 + ... + 148535.

Almost surely, 211021112000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 11021112000 its reverse (21112011), we get a palindrome (11042224011).

The spelling of 11021112000 in words is "eleven billion, twenty-one million, one hundred twelve thousand".