Search a number
-
+
11001111110010 = 2335747397311951
BaseRepresentation
bin1010000000010110010101…
…0100011110000101111010
31102221200210100101220201000
42200011211110132011322
52420220233421010020
635221501330305430
72213542534361160
oct240054524360572
942850710356630
1011001111110010
1135615aa47234a
121298109a28276
1361a5286948b8
142a0656d67230
1514126ded7090
hexa016551e17a

11001111110010 has 256 divisors, whose sum is σ = 34326898606080. Its totient is φ = 2454831878400.

The previous prime is 11001111109999. The next prime is 11001111110021. The reversal of 11001111110010 is 1001111110011.

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

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a Curzon number.

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

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 127 ways as a sum of consecutive naturals, for example, 35109535 + ... + 35421485.

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

Almost surely, 211001111110010 is an apocalyptic number.

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

It is a practical number, because each smaller number is the sum of distinct divisors of 11001111110010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17163449303040).

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

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

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

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

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

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

Adding to 11001111110010 its reverse (1001111110011), we get a palindrome (12002222220021).

Subtracting from 11001111110010 its reverse (1001111110011), we obtain a palindrome (9999999999999).

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