Search a number
-
+
255460011085849 is a prime number
BaseRepresentation
bin111010000101011011101011…
…001101110001000000011001
31020111111201221101220211210111
4322011123223031301000121
5231440424100314221344
62303152413045244321
7104544243135361063
oct7205335315610031
91214451841824714
10255460011085849
1174440a8947a309
1224799a40a036a1
13ac70a112234ab
14471248acb4733
151e8017b50b834
hexe856eb371019

255460011085849 has 2 divisors, whose sum is σ = 255460011085850. Its totient is φ = 255460011085848.

The previous prime is 255460011085843. The next prime is 255460011085871. The reversal of 255460011085849 is 948580110064552.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 198596949708249 + 56863061377600 = 14092443^2 + 7540760^2 .

It is a cyclic number.

It is not a de Polignac number, because 255460011085849 - 215 = 255460011053081 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 255460011085793 and 255460011085802.

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

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

Almost surely, 2255460011085849 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13824000, while the sum is 58.

The spelling of 255460011085849 in words is "two hundred fifty-five trillion, four hundred sixty billion, eleven million, eighty-five thousand, eight hundred forty-nine".