Search a number
-
+
156311164249 is a prime number
BaseRepresentation
bin1001000110010011011…
…1110001010101011001
3112221110121000212122121
42101210313301111121
510030111124223444
6155450334421241
714202351655012
oct2214467612531
9487417025577
10156311164249
1160322639279
1226364361821
1311980c54786
1477cba3c009
1540ecbce084
hex2464df1559

156311164249 has 2 divisors, whose sum is σ = 156311164250. Its totient is φ = 156311164248.

The previous prime is 156311164181. The next prime is 156311164259. The reversal of 156311164249 is 942461113651.

156311164249 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 129623041024 + 26688123225 = 360032^2 + 163365^2 .

It is a cyclic number.

It is not a de Polignac number, because 156311164249 - 215 = 156311131481 is a prime.

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

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

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

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

Almost surely, 2156311164249 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 155520, while the sum is 43.

The spelling of 156311164249 in words is "one hundred fifty-six billion, three hundred eleven million, one hundred sixty-four thousand, two hundred forty-nine".