Search a number
-
+
110100011100000 = 253555313152859
BaseRepresentation
bin11001000010001010101000…
…000011010010011101100000
3112102211110101002002001200220
4121002022220003102131200
5103412334310320200000
61030055125152443040
732122314625035555
oct3102125003223540
9472743332061626
10110100011100000
1132099174a67949
1210422152b49480
13495850419933c
141d28c24650a2c
15cade498e11a0
hex6422a80d2760

110100011100000 has 576 divisors, whose sum is σ = 370875059976960. Its totient is φ = 28585606400000.

The previous prime is 110100011099999. The next prime is 110100011100091. The reversal of 110100011100000 is 1110001011.

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 a congruent number.

It is an unprimeable number.

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 95 ways as a sum of consecutive naturals, for example, 2082873571 + ... + 2082926429.

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

Almost surely, 2110100011100000 is an apocalyptic number.

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

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

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

110100011100000 is an equidigital number, since it uses as much as digits as its factorization.

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

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

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

Adding to 110100011100000 its reverse (1110001011), we get a palindrome (110101121101011).

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