Search a number
-
+
16566505051 = 53312575567
BaseRepresentation
bin11110110110111000…
…01100111001011011
31120202112210122122011
433123130030321123
5232412011130201
611335513410351
71124350653355
oct173334147133
946675718564
1016566505051
1170313a6498
1232641099b7
131740255115
14b322ba0d5
1566e5e9151
hex3db70ce5b

16566505051 has 4 divisors (see below), whose sum is σ = 16879080672. Its totient is φ = 16253929432.

The previous prime is 16566505019. The next prime is 16566505063. The reversal of 16566505051 is 15050566561.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 15050566561 = 122411229521.

It is a cyclic number.

It is not a de Polignac number, because 16566505051 - 25 = 16566505019 is a prime.

It is a Duffinian number.

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

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

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

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

Almost surely, 216566505051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 312575620.

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

The spelling of 16566505051 in words is "sixteen billion, five hundred sixty-six million, five hundred five thousand, fifty-one".

Divisors: 1 53 312575567 16566505051