Search a number
-
+
11010111111110 = 251101011111111
BaseRepresentation
bin1010000000110111110111…
…0000101111111111000110
31102222120000120111100020002
42200031331300233333012
52420342201421023420
635225550351441302
72214311550205346
oct240157560577706
942876016440202
1011010111111110
1135653a8764391
1212999bbb26232
1361b331145537
142a0c6c37cd26
151415e91b4075
hexa037dc2ffc6

11010111111110 has 8 divisors (see below), whose sum is σ = 19818200000016. Its totient is φ = 4404044444440.

The previous prime is 11010111111089. The next prime is 11010111111121. The reversal of 11010111111110 is 1111111101011.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 11010111111091 and 11010111111100.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 550505555546 + ... + 550505555565.

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

Almost surely, 211010111111110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1101011111118.

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

Adding to 11010111111110 its reverse (1111111101011), we get a palindrome (12121222212121).

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

Divisors: 1 2 5 10 1101011111111 2202022222222 5505055555555 11010111111110