Search a number
-
+
11003302101 = 311230312127
BaseRepresentation
bin10100011111101100…
…10001000011010101
31001101211122122212110
422033312101003111
5140013321131401
65015502541233
7536446344651
oct121766210325
931354578773
1011003302101
114737093800
122170b97819
13106481265c
147654cda61
15445ee29d6
hex28fd910d5

11003302101 has 12 divisors (see below), whose sum is σ = 16126052096. Its totient is φ = 6668667720.

The previous prime is 11003302087. The next prime is 11003302109. The reversal of 11003302101 is 10120330011.

11003302101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 11003302101 - 223 = 10994913493 is a prime.

It is a Curzon number.

It is a congruent number.

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 15155701 + ... + 15156426.

Almost surely, 211003302101 is an apocalyptic number.

11003302101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 30312152 (or 30312141 counting only the distinct ones).

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

Adding to 11003302101 its reverse (10120330011), we get a palindrome (21123632112).

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

Divisors: 1 3 11 33 121 363 30312127 90936381 333433397 1000300191 3667767367 11003302101