Search a number
-
+
11011201113 = 311333672761
BaseRepresentation
bin10100100000101000…
…11001100001011001
31001102101111222021110
422100110121201121
5140022331413423
65020344130533
7536603444103
oct122024314131
931371458243
1011011201113
114740599410
122173766a49
131066349b23
14766588573
15446a53193
hex290519859

11011201113 has 8 divisors (see below), whose sum is σ = 16016292576. Its totient is φ = 6673455200.

The previous prime is 11011201109. The next prime is 11011201127. The reversal of 11011201113 is 31110211011.

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

It is a cyclic number.

It is not a de Polignac number, because 11011201113 - 22 = 11011201109 is a prime.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 211011201113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 333672775.

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

Adding to 11011201113 its reverse (31110211011), we get a palindrome (42121412124).

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

Divisors: 1 3 11 33 333672761 1001018283 3670400371 11011201113