Search a number
-
+
152656730561 is a prime number
BaseRepresentation
bin1000111000101100001…
…1001101100111000001
3112121000220120102001202
42032023003031213001
510000120110334221
6154043551310545
714012655541256
oct2161303154701
9477026512052
10152656730561
1159817821145
122570451b455
131151aac618a
14756255d42d
153e86e68d0b
hex238b0cd9c1

152656730561 has 2 divisors, whose sum is σ = 152656730562. Its totient is φ = 152656730560.

The previous prime is 152656730557. The next prime is 152656730579. The reversal of 152656730561 is 165037656251.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 138175014961 + 14481715600 = 371719^2 + 120340^2 .

It is a cyclic number.

It is not a de Polignac number, because 152656730561 - 22 = 152656730557 is a prime.

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

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

Almost surely, 2152656730561 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1134000, while the sum is 47.

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