Search a number
-
+
11001111010110 = 235513532365423
BaseRepresentation
bin1010000000010110010101…
…0100000101101100111110
31102221200210100012211200000
42200011211110011230332
52420220233404310420
635221501324215130
72213542533464004
oct240054524055476
942850710184600
1011001111010110
1135615aa404291
12129810999a4a6
1361a52865b2a0
142a0656d3ca74
1514126deb7690
hexa0165505b3e

11001111010110 has 192 divisors, whose sum is σ = 31950456265728. Its totient is φ = 2707415673984.

The previous prime is 11001111010091. The next prime is 11001111010147. The reversal of 11001111010110 is 1101011110011.

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 = 11001111010092 and 11001111010101.

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 95 ways as a sum of consecutive naturals, for example, 168120859 + ... + 168186281.

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

Almost surely, 211001111010110 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 11001111010110 its reverse (1101011110011), we get a palindrome (12102122120121).

Subtracting from 11001111010110 its reverse (1101011110011), we obtain a palindrome (9900099900099).

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