Search a number
-
+
11010200211 = 332317729791
BaseRepresentation
bin10100100000100001…
…00101001010010011
31001102022122010022000
422100100211022103
5140022102401321
65020310445043
7536562105033
oct122020451223
931368563260
1011010200211
11473aa7541a
122173363783
13106608938a
147663a78c3
15446906826
hex290425293

11010200211 has 16 divisors (see below), whose sum is σ = 17020600320. Its totient is φ = 7020996840.

The previous prime is 11010200207. The next prime is 11010200251. The reversal of 11010200211 is 11200201011.

It is a happy number.

It is not a de Polignac number, because 11010200211 - 22 = 11010200207 is a prime.

It is a super-3 number, since 3×110102002113 (a number of 31 digits) contains 333 as substring.

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

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8864275 + ... + 8865516.

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

Almost surely, 211010200211 is an apocalyptic number.

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

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

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

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

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

Adding to 11010200211 its reverse (11200201011), we get a palindrome (22210401222).

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

Divisors: 1 3 9 23 27 69 207 621 17729791 53189373 159568119 407785193 478704357 1223355579 3670066737 11010200211