Search a number
-
+
110101101000 = 23353113679091
BaseRepresentation
bin110011010001010001…
…0010111100111001000
3101112012010122102212120
41212202202113213020
53300441340213000
6122325120411240
710645256626362
oct1464242274710
9345163572776
10110101101000
114276a223860
1219408776b20
13a4c8437897
1454867bdd32
152ce5e186a0
hex19a28979c8

110101101000 has 256 divisors, whose sum is σ = 375806545920. Its totient is φ = 26615520000.

The previous prime is 110101100971. The next prime is 110101101059. The reversal of 110101101000 is 101101011.

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 self number, because there is not a number n which added to its sum of digits gives 110101101000.

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 63 ways as a sum of consecutive naturals, for example, 12106455 + ... + 12115545.

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

Almost surely, 2110101101000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110101101000 its reverse (101101011), we get a palindrome (110202202011).

It can be divided in two parts, 11010 and 1101000, that multiplied together give a square (12122010000 = 1101002).

The spelling of 110101101000 in words is "one hundred ten billion, one hundred one million, one hundred one thousand".