Search a number
-
+
134602162133 is a prime number
BaseRepresentation
bin111110101011011101…
…0011111111111010101
3110212102122201022020012
41331112322133333111
54201131123142013
6141500235250005
712503365333445
oct1752672377725
9425378638205
10134602162133
11520a245870a
1222105ba9905
13c90149acaa
14672c7aa125
15377bdd21a8
hex1f56e9ffd5

134602162133 has 2 divisors, whose sum is σ = 134602162134. Its totient is φ = 134602162132.

The previous prime is 134602162109. The next prime is 134602162243. The reversal of 134602162133 is 331261206431.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 104514484369 + 30087677764 = 323287^2 + 173458^2 .

It is a cyclic number.

It is not a de Polignac number, because 134602162133 - 26 = 134602162069 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (134602162103) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67301081066 + 67301081067.

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

Almost surely, 2134602162133 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 15552, while the sum is 32.

Adding to 134602162133 its reverse (331261206431), we get a palindrome (465863368564).

The spelling of 134602162133 in words is "one hundred thirty-four billion, six hundred two million, one hundred sixty-two thousand, one hundred thirty-three".