[go: up one dir, main page]

Search a number
-
+
1057287157 is a prime number
BaseRepresentation
bin111111000001001…
…110101111110101
32201200110202022121
4333001032233311
54131131142112
6252525155541
735125535563
oct7701165765
92650422277
101057287157
114a28a1543
122560bbbb1
1313b077404
14a05c0a33
1562c4a407
hex3f04ebf5

1057287157 has 2 divisors, whose sum is σ = 1057287158. Its totient is φ = 1057287156.

The previous prime is 1057287149. The next prime is 1057287181. The reversal of 1057287157 is 7517827501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1006221841 + 51065316 = 31721^2 + 7146^2 .

It is an emirp because it is prime and its reverse (7517827501) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1057287157 - 23 = 1057287149 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21057287157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 137200, while the sum is 43.

The square root of 1057287157 is about 32515.9523465022. The cubic root of 1057287157 is about 1018.7422524308.

The spelling of 1057287157 in words is "one billion, fifty-seven million, two hundred eighty-seven thousand, one hundred fifty-seven".