Search a number
-
+
11001000010101 = 317215705882551
BaseRepresentation
bin1010000000010101111010…
…1100101010000101110101
31102221200111121100110021120
42200011132230222011311
52420220022000310401
635221442321134153
72213540015135553
oct240053654520565
942850447313246
1011001000010101
11356155278a342
12129809878a359
1361a50b6659ca
142a06462c6bd3
1514126438d836
hexa015eb2a175

11001000010101 has 8 divisors (see below), whose sum is σ = 15530823543744. Its totient is φ = 6902588241600.

The previous prime is 11001000010069. The next prime is 11001000010159. The reversal of 11001000010101 is 10101000010011.

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

It is not a de Polignac number, because 11001000010101 - 25 = 11001000010069 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 11001000010101.

It is a congruent number.

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

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

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

Almost surely, 211001000010101 is an apocalyptic number.

It is an amenable number.

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

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

11001000010101 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 215705882571.

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

Adding to 11001000010101 its reverse (10101000010011), we get a palindrome (21102000020112).

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

Divisors: 1 3 17 51 215705882551 647117647653 3667000003367 11001000010101