Search a number
-
+
154655523032201 is a prime number
BaseRepresentation
bin100011001010100010001011…
…100000110100110010001001
3202021120220221022101211022222
4203022202023200310302021
5130232334002344012301
61304531433315423425
744401331014460132
oct4312421340646211
9667526838354288
10154655523032201
11453070479882a4
12154193398b4b75
13683ac5137ab49
142a2951da60c89
1512d2e2991b31b
hex8ca88b834c89

154655523032201 has 2 divisors, whose sum is σ = 154655523032202. Its totient is φ = 154655523032200.

The previous prime is 154655523032191. The next prime is 154655523032321. The reversal of 154655523032201 is 102230325556451.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 100856305340176 + 53799217692025 = 10042724^2 + 7334795^2 .

It is a cyclic number.

It is not a de Polignac number, because 154655523032201 - 26 = 154655523032137 is a prime.

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

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

Almost surely, 2154655523032201 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1080000, while the sum is 44.

Adding to 154655523032201 its reverse (102230325556451), we get a palindrome (256885848588652).

The spelling of 154655523032201 in words is "one hundred fifty-four trillion, six hundred fifty-five billion, five hundred twenty-three million, thirty-two thousand, two hundred one".