Search a number
-
+
110100110100000 = 253551013679901
BaseRepresentation
bin11001000010001010101101…
…111100111100011000100000
3112102211110121222100210011120
4121002022231330330120200
5103412340011141200000
61030055143050412240
732122320236364366
oct3102125574743040
9472743558323146
10110100110100000
1132099215936029
1210422180131080
13495851b84c917
141d28c33861636
15cade534496a0
hex6422adf3c620

110100110100000 has 576 divisors, whose sum is σ = 365850533067264. Its totient is φ = 28987200000000.

The previous prime is 110100110099989. The next prime is 110100110100011. The reversal of 110100110100000 is 1011001011.

It is an interprime number because it is at equal distance from previous prime (110100110099989) and next prime (110100110100011).

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 polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 11120095050 + ... + 11120104950.

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

Almost surely, 2110100110100000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110100110100000 its reverse (1011001011), we get a palindrome (110101121101011).

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