Search a number
-
+
110110100100000 = 253557411131069
BaseRepresentation
bin11001000010010100000001…
…011001110001001110100000
3112102212102102012022100212120
4121002110001121301032200
5103413020441111200000
61030103514235024240
732123122633110000
oct3102240131611640
9472772365270776
10110110100100000
11320a2481a3a980
12104240a989b080
134959451448520
141d29500540000
15cae33a4ce6a0
hex6425016713a0

110110100100000 has 2880 divisors, whose sum is σ = 495608730261120. Its totient is φ = 21100262400000.

The previous prime is 110110100099999. The next prime is 110110100100043. The reversal of 110110100100000 is 1001011011.

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 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 479 ways as a sum of consecutive naturals, for example, 103002899466 + ... + 103002900534.

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

Almost surely, 2110110100100000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110110100100000 its reverse (1001011011), we get a palindrome (110111101111011).

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