Search a number
-
+
153364331504561 is a prime number
BaseRepresentation
bin100010110111101111101010…
…100000000010001110110001
3202010000111010221202010120212
4202313233222200002032301
5130100210122331121221
61302102333512113505
744206131050540042
oct4267575240021661
9663014127663525
10153364331504561
11449594a1a30831
121524b050395895
13677626b154b38
1429c2c322b28c9
1512ae558e8db5b
hex8b7bea8023b1

153364331504561 has 2 divisors, whose sum is σ = 153364331504562. Its totient is φ = 153364331504560.

The previous prime is 153364331504429. The next prime is 153364331504569. The reversal of 153364331504561 is 165405133463351.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 139727884629025 + 13636446875536 = 11820655^2 + 3692756^2 .

It is a cyclic number.

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

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 2153364331504561 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 153364331504561 in words is "one hundred fifty-three trillion, three hundred sixty-four billion, three hundred thirty-one million, five hundred four thousand, five hundred sixty-one".