Search a number
-
+
11140635321111 = 3291011267854253
BaseRepresentation
bin1010001000011110000110…
…0111000110001100010111
31110110000221000211012210010
42202013201213012030113
52430012010120233421
635405534234331303
72226612220531632
oct242074147061427
943400830735703
1011140635321111
11360579822621a
1212bb168289b33
1362a7327ca8aa
142a72d1302c19
15144bd8074076
hexa21e19c6317

11140635321111 has 16 divisors (see below), whose sum is σ = 15518536068960. Its totient is φ = 7099983811200.

The previous prime is 11140635321073. The next prime is 11140635321121. The reversal of 11140635321111 is 11112353604111.

It is not a de Polignac number, because 11140635321111 - 239 = 10590879507223 is a prime.

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

It is a congruent number.

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

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

Almost surely, 211140635321111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1267854386.

The product of its (nonzero) digits is 2160, while the sum is 30.

Adding to 11140635321111 its reverse (11112353604111), we get a palindrome (22252988925222).

The spelling of 11140635321111 in words is "eleven trillion, one hundred forty billion, six hundred thirty-five million, three hundred twenty-one thousand, one hundred eleven".

Divisors: 1 3 29 87 101 303 2929 8787 1267854253 3803562759 36767773337 110303320011 128053279553 384159838659 3713545107037 11140635321111