Search a number
-
+
110101110000000 = 27357729101179
BaseRepresentation
bin11001000010001011101001…
…100011010000100110000000
3112102211120012122211222002220
4121002023221203100212000
5103412344033130000000
61030055430210011040
732122354100400630
oct3102135143204600
9472746178758086
10110101110000000
11320996892a0769
12104223bab76a80
13495864aa53422
141d28cca5846c0
15cadeb110b1a0
hex6422e98d0980

110101110000000 has 2048 divisors, whose sum is σ = 438917626368000. Its totient is φ = 23923200000000.

The previous prime is 110101109999981. The next prime is 110101110000047. The reversal of 110101110000000 is 11101011.

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 255 ways as a sum of consecutive naturals, for example, 615089999911 + ... + 615090000089.

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

Almost surely, 2110101110000000 is an apocalyptic number.

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

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

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

110101110000000 is an frugal number, since it uses more digits than its factorization.

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

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

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

Adding to 110101110000000 its reverse (11101011), we get a palindrome (110101121101011).

The spelling of 110101110000000 in words is "one hundred ten trillion, one hundred one billion, one hundred ten million", and thus it is an aban number.