Search a number
-
+
135055855931 is a prime number
BaseRepresentation
bin111110111000111110…
…1001101000100111011
3110220121021102100010012
41331301331031010323
54203043244342211
6142013243412135
712520544556053
oct1756175150473
9426537370105
10135055855931
1152305567567
1222211b2404b
13c97448c069
146772b4a563
1537a6b4ed8b
hex1f71f4d13b

135055855931 has 2 divisors, whose sum is σ = 135055855932. Its totient is φ = 135055855930.

The previous prime is 135055855861. The next prime is 135055855939. The reversal of 135055855931 is 139558550531.

It is a strong prime.

It is an emirp because it is prime and its reverse (139558550531) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 135055855931 - 210 = 135055854907 is a prime.

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

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

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

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

Almost surely, 2135055855931 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2025000, while the sum is 50.

The spelling of 135055855931 in words is "one hundred thirty-five billion, fifty-five million, eight hundred fifty-five thousand, nine hundred thirty-one".