Search a number
-
+
157107569 is a prime number
BaseRepresentation
bin10010101110101…
…00010101110001
3101221121220001212
421113110111301
5310204420234
623331205505
73615251363
oct1127242561
9357556055
10157107569
1180757273
1244746895
132671a078
1416c18d33
15dbd55ce
hex95d4571

157107569 has 2 divisors, whose sum is σ = 157107570. Its totient is φ = 157107568.

The previous prime is 157107553. The next prime is 157107571. The reversal of 157107569 is 965701751.

157107569 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., 88134544 + 68973025 = 9388^2 + 8305^2 .

It is a cyclic number.

It is not a de Polignac number, because 157107569 - 24 = 157107553 is a prime.

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

Together with 157107571, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

Almost surely, 2157107569 is an apocalyptic number.

It is an amenable number.

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

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

157107569 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 66150, while the sum is 41.

The square root of 157107569 is about 12534.2558215476. The cubic root of 157107569 is about 539.5922493434.

The spelling of 157107569 in words is "one hundred fifty-seven million, one hundred seven thousand, five hundred sixty-nine".