Search a number
-
+
15764794331159 is a prime number
BaseRepresentation
bin1110010101101000011011…
…1101110101000000010111
32001211002200121210211200102
43211122012331311000113
54031242244322044114
653310125130204315
73214653204560516
oct345320675650027
961732617724612
1015764794331159
1150288a245a195
1219273a588369b
138a47c9484b33
143c703d2b467d
151c5129cec2de
hexe5686f75017

15764794331159 has 2 divisors, whose sum is σ = 15764794331160. Its totient is φ = 15764794331158.

The previous prime is 15764794331137. The next prime is 15764794331161. The reversal of 15764794331159 is 95113349746751.

It is a strong prime.

It is a cyclic number.

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

Together with 15764794331161, it forms a pair of twin primes.

It is a Chen prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (15764794331359) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7882397165579 + 7882397165580.

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

Almost surely, 215764794331159 is an apocalyptic number.

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

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

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

The product of its digits is 85730400, while the sum is 65.

The spelling of 15764794331159 in words is "fifteen trillion, seven hundred sixty-four billion, seven hundred ninety-four million, three hundred thirty-one thousand, one hundred fifty-nine".