Search a number
-
+
11001010101 = 323159434929
BaseRepresentation
bin10100011111011011…
…00001011110110101
31001101200100012211120
422033231201132311
5140012224310401
65015341454153
7536421020514
oct121755413665
931350305746
1011001010101
114735868794
122170271359
1310641bc343
1476509467b
15445bdd836
hex28fb617b5

11001010101 has 8 divisors (see below), whose sum is σ = 15305753280. Its totient is φ = 7015136832.

The previous prime is 11001010099. The next prime is 11001010121. The reversal of 11001010101 is 10101010011.

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

It is not a de Polignac number, because 11001010101 - 21 = 11001010099 is a prime.

11001010101 is a modest number, since divided by 1010101 gives 110 as remainder.

It is a Curzon number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11001010121) 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, 79717396 + ... + 79717533.

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

Almost surely, 211001010101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 159434955.

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

Adding to 11001010101 its reverse (10101010011), we get a palindrome (21102020112).

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

Divisors: 1 3 23 69 159434929 478304787 3667003367 11001010101