Search a number
-
+
316876740265067 is a prime number
BaseRepresentation
bin100100000001100101001110…
…1100010101000010001101011
31112112222010020212012111212212
41020003022131202220101223
5313013202031001440232
63041535055334555335
7123513406011011033
oct11003123542502153
91475863225174785
10316876740265067
1191a6a741a13654
122b658a03208b4b
13107a746b549658
145836cb795a8c3
152697a57c4ceb2
hex120329d8a846b

316876740265067 has 2 divisors, whose sum is σ = 316876740265068. Its totient is φ = 316876740265066.

The previous prime is 316876740264971. The next prime is 316876740265069. The reversal of 316876740265067 is 760562047678613.

It is a strong prime.

It is an emirp because it is prime and its reverse (760562047678613) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 316876740265067 - 28 = 316876740264811 is a prime.

Together with 316876740265069, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

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

Almost surely, 2316876740265067 is an apocalyptic number.

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

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

316876740265067 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 426746880, while the sum is 68.

The spelling of 316876740265067 in words is "three hundred sixteen trillion, eight hundred seventy-six billion, seven hundred forty million, two hundred sixty-five thousand, sixty-seven".