Search a number
-
+
156422500561 is a prime number
BaseRepresentation
bin1001000110101110000…
…0011111000011010001
3112221202100112100100201
42101223200133003101
510030323130004221
6155505353015201
714205203213455
oct2215340370321
9487670470321
10156422500561
116037a472958
12263956b4501
131199b037152
1477dc740665
154107872891
hex246b81f0d1

156422500561 has 2 divisors, whose sum is σ = 156422500562. Its totient is φ = 156422500560.

The previous prime is 156422500547. The next prime is 156422500583. The reversal of 156422500561 is 165005224651.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 118253454400 + 38169046161 = 343880^2 + 195369^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-156422500561 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 156422500561.

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

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

Almost surely, 2156422500561 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 72000, while the sum is 37.

The spelling of 156422500561 in words is "one hundred fifty-six billion, four hundred twenty-two million, five hundred thousand, five hundred sixty-one".