Search a number
-
+
491316077797 is a prime number
BaseRepresentation
bin1110010011001001011…
…10000110010011100101
31201222011122212202110021
413021210232012103211
531022203403442142
61013412452355141
750332161520036
oct7114456062345
91658148782407
10491316077797
1117a403132196
127b278915ab1
133743c00767c
1419acbba8a8d
15cba858e267
hex7264b864e5

491316077797 has 2 divisors, whose sum is σ = 491316077798. Its totient is φ = 491316077796.

The previous prime is 491316077779. The next prime is 491316077821. The reversal of 491316077797 is 797770613194.

Together with previous prime (491316077779) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 417730835041 + 73585242756 = 646321^2 + 271266^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-491316077797 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2491316077797 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 14002632, while the sum is 61.

The spelling of 491316077797 in words is "four hundred ninety-one billion, three hundred sixteen million, seventy-seven thousand, seven hundred ninety-seven".