Search a number
-
+
157497139211 is a prime number
BaseRepresentation
bin1001001010101110001…
…1111010000000001011
3120001112020122122110012
42102223203322000023
510040023231423321
6200204142142135
714243632410656
oct2225343720013
9501466578405
10157497139211
1160881035875
122663558194b
1311b0c8782c9
1478a135a89d
15416bd9905b
hex24ab8fa00b

157497139211 has 2 divisors, whose sum is σ = 157497139212. Its totient is φ = 157497139210.

The previous prime is 157497139141. The next prime is 157497139213. The reversal of 157497139211 is 112931794751.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 157497139211 - 230 = 156423397387 is a prime.

It is a super-2 number, since 2×1574971392112 (a number of 23 digits) contains 22 as substring.

Together with 157497139213, 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 157497139211.

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

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

Almost surely, 2157497139211 is an apocalyptic number.

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

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

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

The product of its digits is 476280, while the sum is 50.

The spelling of 157497139211 in words is "one hundred fifty-seven billion, four hundred ninety-seven million, one hundred thirty-nine thousand, two hundred eleven".