Search a number
-
+
11001101010109 = 71571585858587
BaseRepresentation
bin1010000000010110010010…
…1101111100010010111101
31102221200202122101210020121
42200011210231330102331
52420220223324310414
635221500330014541
72213542352464330
oct240054455742275
942850678353217
1011001101010109
1135615a47a4121
121298106577451
1361a526569722
142a0655898617
1514126d18e724
hexa0164b7c4bd

11001101010109 has 4 divisors (see below), whose sum is σ = 12572686868704. Its totient is φ = 9429515151516.

The previous prime is 11001101010103. The next prime is 11001101010121. The reversal of 11001101010109 is 90101010110011.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 11001101010109 - 29 = 11001101009597 is a prime.

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11001101010103) by changing a digit.

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

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

Almost surely, 211001101010109 is an apocalyptic number.

It is an amenable number.

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

11001101010109 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 1571585858594.

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

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

Divisors: 1 7 1571585858587 11001101010109