Search a number
-
+
110100011010000 = 2435411367909091
BaseRepresentation
bin11001000010001010101000…
…000010111100011111010000
3112102211110101001220111020120
4121002022220002330133100
5103412334310304310000
61030055125150510240
732122314624212304
oct3102125002743720
9472743331814216
10110100011010000
1132099174a06270
1210422152b05380
13495850416739b
141d28c24629d04
15cade498c46a0
hex6422a80bc7d0

110100011010000 has 400 divisors, whose sum is σ = 388785106541568. Its totient is φ = 26618155200000.

The previous prime is 110100011009981. The next prime is 110100011010023. The reversal of 110100011010000 is 10110001011.

It is a tau number, because it is divible by the number of its divisors (400).

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 (19) of ones.

It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 120655455 + ... + 121564545.

Almost surely, 2110100011010000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110100011010000 its reverse (10110001011), we get a palindrome (110110121011011).

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