Search a number
-
+
151056560597 is a prime number
BaseRepresentation
bin1000110010101110101…
…1000011000111010101
3112102220101120100112112
42030223223003013111
54433330434414342
6153221110200405
713625215402565
oct2145353030725
9472811510475
10151056560597
1159076543828
1225338653105
1311324430c47
14744dc22da5
153de1734682
hex232bac31d5

151056560597 has 2 divisors, whose sum is σ = 151056560598. Its totient is φ = 151056560596.

The previous prime is 151056560591. The next prime is 151056560609. The reversal of 151056560597 is 795065650151.

151056560597 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 140805808081 + 10250752516 = 375241^2 + 101246^2 .

It is a cyclic number.

It is not a de Polignac number, because 151056560597 - 222 = 151052366293 is a prime.

It is a congruent number.

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

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

Almost surely, 2151056560597 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1417500, while the sum is 50.

The spelling of 151056560597 in words is "one hundred fifty-one billion, fifty-six million, five hundred sixty thousand, five hundred ninety-seven".