Search a number
-
+
110000100100000 = 255511294098431
BaseRepresentation
bin11001000000101101100100…
…111001000100011110100000
3112102110220111002220101111111
4121000231210321010132200
5103404220201111200000
61025541203125153104
732112150011406355
oct3100554471043640
9472426432811444
10110000100100000
113205a86489a870
121040690ab5b794
13494bc70c4b626
141d2406735a62c
15cab54d3d6cba
hex640b64e447a0

110000100100000 has 576 divisors, whose sum is σ = 306259623129600. Its totient is φ = 38521728000000.

The previous prime is 110000100099983. The next prime is 110000100100001. The reversal of 110000100100000 is 1001000011.

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

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

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

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

Almost surely, 2110000100100000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110000100100000 its reverse (1001000011), we get a palindrome (110001101100011).

It can be divided in two parts, 1 and 10000100100000, that added together give a palindrome (10000100100001).

The spelling of 110000100100000 in words is "one hundred ten trillion, one hundred million, one hundred thousand".