Search a number
-
+
157062641 is a prime number
BaseRepresentation
bin10010101110010…
…01010111110001
3101221112121102212
421113021113301
5310202001031
623330221505
73615003401
oct1127112761
9357477385
10157062641
118072653a
1244724895
1326702798
1416c06801
15dbc712b
hex95c95f1

157062641 has 2 divisors, whose sum is σ = 157062642. Its totient is φ = 157062640.

The previous prime is 157062593. The next prime is 157062667. The reversal of 157062641 is 146260751.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 105165025 + 51897616 = 10255^2 + 7204^2 .

It is a cyclic number.

It is not a de Polignac number, because 157062641 - 214 = 157046257 is a prime.

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

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

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

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

Almost surely, 2157062641 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10080, while the sum is 32.

The square root of 157062641 is about 12532.4634848860. The cubic root of 157062641 is about 539.5408087667.

The spelling of 157062641 in words is "one hundred fifty-seven million, sixty-two thousand, six hundred forty-one".