Search a number
BaseRepresentation
bin10100100000101000…
…00011100010110101
31001102101100101210101
422100110003202311
5140022321023333
65020342154101
7536602620463
oct122024034265
931371311711
1011011111093
114740537814
122173722931
131066317b68
14766563833
15446a3667d
hex2905038b5

11011111093 has 16 divisors (see below), whose sum is σ = 11433470400. Its totient is φ = 10597434624.

The previous prime is 11011111051. The next prime is 11011111117. The reversal of 11011111093 is 39011111011.

It is a happy number.

It is not a de Polignac number, because 11011111093 - 29 = 11011110581 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 11011111093.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 211011111093 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 13428.

The product of its (nonzero) digits is 27, while the sum is 19.

The spelling of 11011111093 in words is "eleven billion, eleven million, one hundred eleven thousand, ninety-three".