Search a number
-
+
271674316609361 is a prime number
BaseRepresentation
bin111101110001011000011011…
…001000101101011101010001
31022121220210220020100020001122
4331301120123020231131101
5241102103000022444421
62401445242540412025
7111136551553325321
oct7561303310553521
91277823806306048
10271674316609361
1179622481211486
1226578376b47015
13b878a1671c783
144b1316db9b281
152161d146e02ab
hexf7161b22d751

271674316609361 has 2 divisors, whose sum is σ = 271674316609362. Its totient is φ = 271674316609360.

The previous prime is 271674316609309. The next prime is 271674316609393. The reversal of 271674316609361 is 163906613476172.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 270803885454400 + 870431154961 = 16456120^2 + 932969^2 .

It is a cyclic number.

It is not a de Polignac number, because 271674316609361 - 214 = 271674316592977 is a prime.

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

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

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

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

Almost surely, 2271674316609361 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 41150592, while the sum is 62.

The spelling of 271674316609361 in words is "two hundred seventy-one trillion, six hundred seventy-four billion, three hundred sixteen million, six hundred nine thousand, three hundred sixty-one".