Search a number
-
+
134362722953 is a prime number
BaseRepresentation
bin111110100100010100…
…1000111001010001001
3110211210222011112102102
41331020221013022021
54200133324113303
6141420403243145
712464430205154
oct1751051071211
9424728145372
10134362722953
1151a8a288498
12220599794b5
13c8939b54c4
146708a7cc9b
153765d87288
hex1f48a47289

134362722953 has 2 divisors, whose sum is σ = 134362722954. Its totient is φ = 134362722952.

The previous prime is 134362722917. The next prime is 134362722973. The reversal of 134362722953 is 359227263431.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 133928917369 + 433805584 = 365963^2 + 20828^2 .

It is a cyclic number.

It is not a de Polignac number, because 134362722953 - 212 = 134362718857 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 2134362722953 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 1632960, while the sum is 47.

The spelling of 134362722953 in words is "one hundred thirty-four billion, three hundred sixty-two million, seven hundred twenty-two thousand, nine hundred fifty-three".