Search a number
-
+
14588558961157 is a prime number
BaseRepresentation
bin1101010001001010100111…
…0111111110101000000101
31220122122121202110000110101
43110102221313332220011
53403004332043224112
651005520320124101
73033663043105156
oct324225167765005
956578552400411
1014588558961157
114714a78235385
12177743aa66631
1381a9064a6b8c
1438613903792d
151a473660d757
hexd44a9dfea05

14588558961157 has 2 divisors, whose sum is σ = 14588558961158. Its totient is φ = 14588558961156.

The previous prime is 14588558961077. The next prime is 14588558961161. The reversal of 14588558961157 is 75116985588541.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9238007069281 + 5350551891876 = 3039409^2 + 2313126^2 .

It is a cyclic number.

It is not a de Polignac number, because 14588558961157 - 27 = 14588558961029 is a prime.

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

It is a congruent number.

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

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

Almost surely, 214588558961157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 483840000, while the sum is 73.

The spelling of 14588558961157 in words is "fourteen trillion, five hundred eighty-eight billion, five hundred fifty-eight million, nine hundred sixty-one thousand, one hundred fifty-seven".