Search a number
-
+
11068993597 = 79140113843
BaseRepresentation
bin10100100111100001…
…10111000000111101
31001120102021010122211
422103300313000331
5140132130243342
65030210540421
7541204615234
oct122360670075
931512233584
1011068993597
1147701817a2
12218ab97711
13107530306c
1477010db1b
1544bb6bc17
hex293c3703d

11068993597 has 4 divisors (see below), whose sum is σ = 11209107520. Its totient is φ = 10928879676.

The previous prime is 11068993511. The next prime is 11068993601. The reversal of 11068993597 is 79539986011.

11068993597 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, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-11068993597 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 211068993597 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 140113922.

The product of its (nonzero) digits is 3674160, while the sum is 58.

The spelling of 11068993597 in words is "eleven billion, sixty-eight million, nine hundred ninety-three thousand, five hundred ninety-seven".

Divisors: 1 79 140113843 11068993597