Search a number
-
+
11200010001111 = 323733633663667
BaseRepresentation
bin1010001011111011010010…
…0111100001101011010111
31110122201011221202110202100
42202332310213201223113
52432000110030013421
635453114044013143
72234113455143151
oct242766447415327
943581157673670
1011200010001111
113628996731098
12130a7788311b3
13633205835439
142aa124adbad1
15146510956c26
hexa2fb49e1ad7

11200010001111 has 12 divisors (see below), whose sum is σ = 16615029851992. Its totient is φ = 7264871351856.

The previous prime is 11200010001071. The next prime is 11200010001127. The reversal of 11200010001111 is 11110001000211.

It is not a de Polignac number, because 11200010001111 - 214 = 11200009984727 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 = 11200010001093 and 11200010001102.

It is a congruent number.

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

Almost surely, 211200010001111 is an apocalyptic number.

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

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

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

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

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

Adding to 11200010001111 its reverse (11110001000211), we get a palindrome (22310011001322).

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

Divisors: 1 3 9 37 111 333 33633663667 100900991001 302702973003 1244445555679 3733336667037 11200010001111