Search a number
-
+
134057425199161 is a prime number
BaseRepresentation
bin11110011110110010101101…
…001101010110000000111001
3122120122202122110100100201011
4132132302231031112000321
5120032344101322333121
61153041044141153521
740144220652643402
oct3636625515260071
9576582573310634
10134057425199161
1139795486722982
121305128855b8a1
1359a573a54b8b9
1425165b202c9a9
15107721bc027e1
hex79ecad356039

134057425199161 has 2 divisors, whose sum is σ = 134057425199162. Its totient is φ = 134057425199160.

The previous prime is 134057425199101. The next prime is 134057425199177. The reversal of 134057425199161 is 161991524750431.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 133607452559161 + 449972640000 = 11558869^2 + 670800^2 .

It is a cyclic number.

It is not a de Polignac number, because 134057425199161 - 217 = 134057425068089 is a prime.

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

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

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

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

Almost surely, 2134057425199161 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 134057425199161 in words is "one hundred thirty-four trillion, fifty-seven billion, four hundred twenty-five million, one hundred ninety-nine thousand, one hundred sixty-one".