Search a number
11011100100000 = 253557111337991
BaseRepresentation
bin1010000000111011100010…
…1101011100010110100000
31102222122120111110011221020
42200032320231130112200
52420401213111200000
635230232441125440
72214345216366030
oct240167055342640
942878514404836
1011011100100000
113565865a47380
12129a037189880
1361b45acc8870
142a0d238618c0
15141655e1cba0
hexa03b8b5c5a0

11011100100000 has 2304 divisors, whose sum is σ = 49868616204288. Its totient is φ = 2052864000000.

The previous prime is 11011100099981. The next prime is 11011100100019. The reversal of 11011100100000 is 100111011.

Adding to 11011100100000 its reverse (100111011), we get a palindrome (11011200211011).

It is an interprime number because it is at equal distance from previous prime (11011100099981) and next prime (11011100100019).

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

It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.

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 383 ways as a sum of consecutive naturals, for example, 11111099505 + ... + 11111100495.

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

Almost surely, 211011100100000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 1, while the sum is 6.

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