Search a number
-
+
154951157 is a prime number
BaseRepresentation
bin10010011110001…
…01110111110101
3101210120100000202
421033011313311
5304131414112
623213050245
73561030434
oct1117056765
9353510022
10154951157
117a514109
1243a86985
132614369a
141681711b
15d90b6c2
hex93c5df5

154951157 has 2 divisors, whose sum is σ = 154951158. Its totient is φ = 154951156.

The previous prime is 154951133. The next prime is 154951201. The reversal of 154951157 is 751159451.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 137968516 + 16982641 = 11746^2 + 4121^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×1549511572 = 48019722111277298, which contains 22 as substring.

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 154951157.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (154951127) 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 as a sum of consecutive naturals, namely, 77475578 + 77475579.

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

Almost surely, 2154951157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 31500, while the sum is 38.

The square root of 154951157 is about 12447.9378613488. The cubic root of 154951157 is about 537.1121060769.

The spelling of 154951157 in words is "one hundred fifty-four million, nine hundred fifty-one thousand, one hundred fifty-seven".