Search a number
-
+
16511111057 = 72358730151
BaseRepresentation
bin11110110000010001…
…11000111110010001
31120121200120100100202
433120020320332101
5232303321023212
611330214224545
71123106062010
oct173010707621
946550510322
1016511111057
117003101131
123249655155
13173192b7cc
14b28bbaa77
156698060c2
hex3d8238f91

16511111057 has 4 divisors (see below), whose sum is σ = 18869841216. Its totient is φ = 14152380900.

The previous prime is 16511111009. The next prime is 16511111137. The reversal of 16511111057 is 75011111561.

16511111057 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 not a de Polignac number, because 16511111057 - 214 = 16511094673 is a prime.

It is a Duffinian number.

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

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

Almost surely, 216511111057 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2358730158.

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

The spelling of 16511111057 in words is "sixteen billion, five hundred eleven million, one hundred eleven thousand, fifty-seven".

Divisors: 1 7 2358730151 16511111057