Search a number
-
+
11120011415 = 512717511829
BaseRepresentation
bin10100101101100110…
…11110100010010111
31001200222021002221122
422112303132202113
5140233210331130
65035232234155
7542364352232
oct122663364227
931628232848
1011120011415
114796a58187
1221a409b95b
131082a56816
14776bd0419
154513982e5
hex296cde897

11120011415 has 8 divisors (see below), whose sum is σ = 13449085440. Its totient is φ = 8825961312.

The previous prime is 11120011391. The next prime is 11120011429. The reversal of 11120011415 is 51411002111.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 11120011415 - 26 = 11120011351 is a prime.

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

It is a congruent number.

It is an unprimeable number.

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

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

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

Almost surely, 211120011415 is an apocalyptic number.

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

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

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

The sum of its prime factors is 17511961.

The product of its (nonzero) digits is 40, while the sum is 17.

Adding to 11120011415 its reverse (51411002111), we get a palindrome (62531013526).

The spelling of 11120011415 in words is "eleven billion, one hundred twenty million, eleven thousand, four hundred fifteen".

Divisors: 1 5 127 635 17511829 87559145 2224002283 11120011415