Search a number
-
+
11211111000 = 23325337131257
BaseRepresentation
bin10100111000011101…
…11111101001011000
31001221022200110002100
422130032333221120
5140430021023000
65052245003400
7544551604545
oct123416775130
931838613070
1011211111000
11483341a6a1
12220a6b3560
1310988a20bb
14784d45bcc
15459390a00
hex29c3bfa58

11211111000 has 384 divisors, whose sum is σ = 39367373760. Its totient is φ = 2875392000.

The previous prime is 11211110993. The next prime is 11211111017. The reversal of 11211111000 is 11111211.

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 pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 43622872 + ... + 43623128.

Almost surely, 211211111000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 11211111000 its reverse (11111211), we get a palindrome (11222222211).

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