Search a number
-
+
11010201100011 = 323733063666967
BaseRepresentation
bin1010000000111000001100…
…1000000001111011101011
31102222120020211211020210100
42200032003020001323223
52420342342440200021
635230003324320443
72214314022123561
oct240160310017353
942876224736710
1011010201100011
113565444538383
121299a260a3123
1361b3469923c9
142a0c7a2c5a31
1514160203c626
hexa0383201eeb

11010201100011 has 12 divisors (see below), whose sum is σ = 16333451482192. Its totient is φ = 7141752064656.

The previous prime is 11010201100009. The next prime is 11010201100027. The reversal of 11010201100011 is 11000110201011.

It is not a de Polignac number, because 11010201100011 - 21 = 11010201100009 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 11010201099966 and 11010201100002.

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

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

Almost surely, 211010201100011 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 2, while the sum is 9.

Adding to 11010201100011 its reverse (11000110201011), we get a palindrome (22010311301022).

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

Divisors: 1 3 9 37 111 333 33063666967 99191000901 297573002703 1223355677779 3670067033337 11010201100011