Search a number
-
+
100010011011110 = 2520681394835749
BaseRepresentation
bin10110101111010101100101…
…001011100010100000100110
3111010002212022121210120210222
4112233111211023202200212
5101102031000304323420
6552411544221244342
730031325206264454
oct2657254513424046
9433085277716728
10100010011011110
1129959009a61a82
12b27273a4036b2
1343a5b991ba265
141a9a7205dd9d4
15b86753605225
hex5af5652e2826

100010011011110 has 16 divisors (see below), whose sum is σ = 180018144090000. Its totient is φ = 40003976788896.

The previous prime is 100010011011109. The next prime is 100010011011161. The reversal of 100010011011110 is 11110110010001.

It is a Curzon number.

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18263516 + ... + 23099264.

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

Almost surely, 2100010011011110 is an apocalyptic number.

100010011011110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

100010011011110 is a deficient number, since it is larger than the sum of its proper divisors (80008133078890).

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

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

The sum of its prime factors is 6903895.

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

Adding to 100010011011110 its reverse (11110110010001), we get a palindrome (111120121021111).

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

Divisors: 1 2 5 10 2068139 4136278 4835749 9671498 10340695 20681390 24178745 48357490 10001001101111 20002002202222 50005005505555 100010011011110