Search a number
-
+
793439111981 is a prime number
BaseRepresentation
bin10111000101111001010…
…10000000101100101101
32210212000010200002121002
423202330222000230231
5100444430403040411
61404300105450045
7111216106113425
oct13427452005455
92725003602532
10793439111981
1128654a76a49a
121099351a0925
1359a8992a609
142a58cc71485
151598c31533b
hexb8bca80b2d

793439111981 has 2 divisors, whose sum is σ = 793439111982. Its totient is φ = 793439111980.

The previous prime is 793439111903. The next prime is 793439111989. The reversal of 793439111981 is 189111934397.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 504823039081 + 288616072900 = 710509^2 + 537230^2 .

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

It is a cyclic number.

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

It is a super-2 number, since 2×7934391119812 (a number of 25 digits) contains 22 as substring.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (793439111989) 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, 396719555990 + 396719555991.

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

Almost surely, 2793439111981 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 1469664, while the sum is 56.

The spelling of 793439111981 in words is "seven hundred ninety-three billion, four hundred thirty-nine million, one hundred eleven thousand, nine hundred eighty-one".