Search a number
-
+
134782906957 is a prime number
BaseRepresentation
bin111110110000110101…
…1111111001001001101
3110212220020211002111221
41331201223333021031
54202013411010312
6141530213243341
712511021543336
oct1754153771115
9425806732457
10134782906957
11521854899a6
1222156633551
13c92ca72baa
1467487b928d
15378cbd6207
hex1f61aff24d

134782906957 has 2 divisors, whose sum is σ = 134782906958. Its totient is φ = 134782906956.

The previous prime is 134782906949. The next prime is 134782906967. The reversal of 134782906957 is 759609287431.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 99506178916 + 35276728041 = 315446^2 + 187821^2 .

It is a cyclic number.

It is not a de Polignac number, because 134782906957 - 23 = 134782906949 is a prime.

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

It is a congruent number.

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

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

It is a 1-persistent number, because it is pandigital, but 2⋅134782906957 = 269565813914 is not.

Almost surely, 2134782906957 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 22861440, while the sum is 61.

The spelling of 134782906957 in words is "one hundred thirty-four billion, seven hundred eighty-two million, nine hundred six thousand, nine hundred fifty-seven".