Search a number
-
+
11001111101212 = 2231198014480513
BaseRepresentation
bin1010000000010110010101…
…0100011011111100011100
31102221200210100101110122011
42200011211110123330130
52420220233420214322
635221501330201004
72213542534323421
oct240054524337434
942850710343564
1011001111101212
1135615aa466781
121298109a23164
1361a5286908ab
142a0656d63d48
1514126ded4677
hexa016551bf1c

11001111101212 has 24 divisors (see below), whose sum is σ = 19873982963072. Its totient is φ = 5322848256000.

The previous prime is 11001111101209. The next prime is 11001111101219. The reversal of 11001111101212 is 21210111110011.

It is a super-2 number, since 2×110011111012122 (a number of 27 digits) contains 22 as substring.

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

It is a congruent number.

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

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

Almost surely, 211001111101212 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 11001111101212 its reverse (21210111110011), we get a palindrome (32211222211223).

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

Divisors: 1 2 4 31 62 124 19801 39602 79204 613831 1227662 2455324 4480513 8961026 17922052 138895903 277791806 555583612 88718637913 177437275826 354874551652 2750277775303 5500555550606 11001111101212