Search a number
-
+
154261456721 is a prime number
BaseRepresentation
bin1000111110101010110…
…0110000011101010001
3112202011202010221111222
42033222230300131101
510011411413103341
6154511114214425
714100512514221
oct2175254603521
9482152127458
10154261456721
115a470630709
1225a91a24415
13117153c5198
147675724081
15402cc9d44b
hex23eab30751

154261456721 has 2 divisors, whose sum is σ = 154261456722. Its totient is φ = 154261456720.

The previous prime is 154261456649. The next prime is 154261456751. The reversal of 154261456721 is 127654162451.

154261456721 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., 125780169025 + 28481287696 = 354655^2 + 168764^2 .

It is a cyclic number.

It is not a de Polignac number, because 154261456721 - 222 = 154257262417 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 2154261456721 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 403200, while the sum is 44.

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