Search a number
-
+
15661650157 = 27157792067
BaseRepresentation
bin11101001011000000…
…11101000011101101
31111102111011021001221
432211200131003231
5224033340301112
611110031303341
71063052554426
oct164540350355
944374137057
1015661650157
11670765862a
12305107ab51
13162794ba1a
14a8805864d
15619e5de07
hex3a581d0ed

15661650157 has 4 divisors (see below), whose sum is σ = 15719442496. Its totient is φ = 15603857820.

The previous prime is 15661650139. The next prime is 15661650227. The reversal of 15661650157 is 75105616651.

15661650157 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 not a de Polignac number, because 15661650157 - 211 = 15661648109 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 (15661650127) 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, 28895763 + ... + 28896304.

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

Almost surely, 215661650157 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 57792338.

The product of its (nonzero) digits is 189000, while the sum is 43.

The spelling of 15661650157 in words is "fifteen billion, six hundred sixty-one million, six hundred fifty thousand, one hundred fifty-seven".

Divisors: 1 271 57792067 15661650157