Search a number
-
+
999976000157 is a prime number
BaseRepresentation
bin11101000110100110011…
…01101101101010011101
310112121010001021002212222
432203103031231222131
5112340422324001112
62043214352035125
7132150223520441
oct16432315555235
93477101232788
10999976000157
113560a6423512
12141975b32aa5
13733b3314954
143658319a821
151b0295c5372
hexe8d336da9d

999976000157 has 2 divisors, whose sum is σ = 999976000158. Its totient is φ = 999976000156.

The previous prime is 999976000141. The next prime is 999976000159. The reversal of 999976000157 is 751000679999.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 923186602276 + 76789397881 = 960826^2 + 277109^2 .

It is a cyclic number.

It is not a de Polignac number, because 999976000157 - 24 = 999976000141 is a prime.

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

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 999976000157.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (999976000159) 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, 499988000078 + 499988000079.

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

Almost surely, 2999976000157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9644670, while the sum is 62.

The spelling of 999976000157 in words is "nine hundred ninety-nine billion, nine hundred seventy-six million, one hundred fifty-seven", and thus it is an aban number.