Search a number
-
+
321013100649779 is a prime number
BaseRepresentation
bin100100011111101011010111…
…1110101010001110100110011
31120002121112220221000110222222
41020333112233311101310303
5314033434312231243104
63054423214345151255
7124421300614115156
oct11077265765216463
91502545827013888
10321013100649779
119331498958253a
12300065a5a8b52b
1310a17536b66555
14593b18cd85c9d
15271a44a1401be
hex123f5afd51d33

321013100649779 has 2 divisors, whose sum is σ = 321013100649780. Its totient is φ = 321013100649778.

The previous prime is 321013100649763. The next prime is 321013100649781. The reversal of 321013100649779 is 977946001310123.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 321013100649779 - 24 = 321013100649763 is a prime.

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

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 321013100649779.

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

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

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

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

Almost surely, 2321013100649779 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1714608, while the sum is 53.

The spelling of 321013100649779 in words is "three hundred twenty-one trillion, thirteen billion, one hundred million, six hundred forty-nine thousand, seven hundred seventy-nine".