Search a number
-
+
110111011101000 = 233253713373679901
BaseRepresentation
bin11001000010010100110111…
…101100111101100101001000
3112102212111202200112000022100
4121002110313230331211020
5103413024322320213000
61030104144500553400
732123154334354410
oct3102246754754510
9472774680460270
10110111011101000
11320a28aa1a6468
12104243029b2860
1349595680c4280
141d29589521640
15cae390480a00
hex642537b3d948

110111011101000 has 1536 divisors, whose sum is σ = 471771356958720. Its totient is φ = 22540446720000.

The previous prime is 110111011100989. The next prime is 110111011101001. The reversal of 110111011101000 is 101110111011.

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

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

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

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

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

It is a polite number, since it can be written in 383 ways as a sum of consecutive naturals, for example, 11121196050 + ... + 11121205950.

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

Almost surely, 2110111011101000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110111011101000 its reverse (101110111011), we get a palindrome (110212121212011).

It can be divided in two parts, 110111011 and 101000, that added together give a palindrome (110212011).

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