Search a number
-
+
11061516071 = 71155796001
BaseRepresentation
bin10100100110101000…
…10101011100100111
31001112220012020102102
422103110111130213
5140123222003241
65025342402315
7541054222664
oct122324253447
931486166372
1011061516071
114766a34821
12218859039b
1310738b56a8
1476d124a6b
1544b19139b
hex293515727

11061516071 has 4 divisors (see below), whose sum is σ = 11217312144. Its totient is φ = 10905720000.

The previous prime is 11061516049. The next prime is 11061516073. The reversal of 11061516071 is 17061516011.

11061516071 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 an emirpimes, since its reverse is a distinct semiprime: 17061516011 = 51533310987.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-11061516071 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 (11061516073) 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, 77897930 + ... + 77898071.

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

Almost surely, 211061516071 is an apocalyptic number.

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

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

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

The sum of its prime factors is 155796072.

The product of its (nonzero) digits is 1260, while the sum is 29.

The spelling of 11061516071 in words is "eleven billion, sixty-one million, five hundred sixteen thousand, seventy-one".

Divisors: 1 71 155796001 11061516071