Search a number
-
+
11001101113 = 67317517967
BaseRepresentation
bin10100011111011011…
…10111101100111001
31001101200111211200101
422033231313230321
5140012240213423
65015343435401
7536421550042
oct121755675471
931350454611
1011001101113
114735920102
1221702b5b61
1310642218b2
147650b98c9
15445c0a7ad
hex28fb77b39

11001101113 has 8 divisors (see below), whose sum is σ = 11200540032. Its totient is φ = 10802698896.

The previous prime is 11001101071. The next prime is 11001101131. The reversal of 11001101113 is 31110110011.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-11001101113 is a prime.

It is a Duffinian number.

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

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

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

Almost surely, 211001101113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 518351.

The product of its (nonzero) digits is 3, while the sum is 10.

Adding to 11001101113 its reverse (31110110011), we get a palindrome (42111211124).

The spelling of 11001101113 in words is "eleven billion, one million, one hundred one thousand, one hundred thirteen".

Divisors: 1 67 317 21239 517967 34703789 164195539 11001101113