Search a number
-
+
11115390223 = 71587912889
BaseRepresentation
bin10100101101000011…
…10110010100001111
31001200122120022212101
422112201312110033
5140231014441343
65034545215531
7542310154330
oct122641662417
931618508771
1011115390223
114794391213
1221a26315a7
131081ac92a2
1477634a287
15450c83e4d
hex29687650f

11115390223 has 4 divisors (see below), whose sum is σ = 12703303120. Its totient is φ = 9527477328.

The previous prime is 11115390199. The next prime is 11115390227. The reversal of 11115390223 is 32209351111.

11115390223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 11115390223 - 29 = 11115389711 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 793956438 + ... + 793956451.

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

Almost surely, 211115390223 is an apocalyptic number.

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

11115390223 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 1587912896.

The product of its (nonzero) digits is 1620, while the sum is 28.

The spelling of 11115390223 in words is "eleven billion, one hundred fifteen million, three hundred ninety thousand, two hundred twenty-three".

Divisors: 1 7 1587912889 11115390223