Search a number
-
+
855063141509 is a prime number
BaseRepresentation
bin11000111000101011011…
…11000001110010000101
310000202001211011011001002
430130111233001302011
5103002132131012014
61452451030343045
7115530155532203
oct14342557016205
93022054134032
10855063141509
112aa6a2940a15
12119872abaa85
136282a984b05
142d5572b2073
1517397411dde
hexc715bc1c85

855063141509 has 2 divisors, whose sum is σ = 855063141510. Its totient is φ = 855063141508.

The previous prime is 855063141371. The next prime is 855063141533. The reversal of 855063141509 is 905141360558.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 835801865284 + 19261276225 = 914222^2 + 138785^2 .

It is a cyclic number.

It is not a de Polignac number, because 855063141509 - 216 = 855063075973 is a prime.

It is a super-2 number, since 2×8550631415092 (a number of 25 digits) contains 22 as substring.

It is a congruent number.

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

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

Almost surely, 2855063141509 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 648000, while the sum is 47.

The spelling of 855063141509 in words is "eight hundred fifty-five billion, sixty-three million, one hundred forty-one thousand, five hundred nine".