Search a number
-
+
76710701056097 is a prime number
BaseRepresentation
bin10001011100010010011010…
…000101100100000001100001
3101001121110201122120200201202
4101130102122011210001201
540023312003432243342
6431052224244410545
722105110453323063
oct2134223205440141
9331543648520652
1076710701056097
11224959099a1a89
12872b06a6a6a55
1333a5a3250cb94
1414d2b63c4d733
158d064c224332
hex45c49a164061

76710701056097 has 2 divisors, whose sum is σ = 76710701056098. Its totient is φ = 76710701056096.

The previous prime is 76710701056061. The next prime is 76710701056109. The reversal of 76710701056097 is 79065010701767.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 41650553468176 + 35060147587921 = 6453724^2 + 5921161^2 .

It is a cyclic number.

It is not a de Polignac number, because 76710701056097 - 232 = 76706406088801 is a prime.

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

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

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

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

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

Almost surely, 276710701056097 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3889620, while the sum is 56.

The spelling of 76710701056097 in words is "seventy-six trillion, seven hundred ten billion, seven hundred one million, fifty-six thousand, ninety-seven".