Search a number
-
+
11000223696 = 2437116197503
BaseRepresentation
bin10100011111010101…
…00001011111010000
31001101121212021002110
422033222201133100
5140012024124241
65015312545320
7536411234010
oct121752413720
931347767073
1011000223696
114735380970
12216bb52240
131063ca5407
14764d2bc40
15445ad5816
hex28faa17d0

11000223696 has 320 divisors, whose sum is σ = 36453666816. Its totient is φ = 2775859200.

The previous prime is 11000223659. The next prime is 11000223697. The reversal of 11000223696 is 69632200011.

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

It is a congruent number.

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

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

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

Almost surely, 211000223696 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 3888, while the sum is 30.

The spelling of 11000223696 in words is "eleven billion, two hundred twenty-three thousand, six hundred ninety-six".