Search a number
-
+
4993761151961 is a prime number
BaseRepresentation
bin100100010101011001101…
…0111000000101111011001
3122200101202210121210211022
41020222303113000233121
51123304210323330321
614342034024212225
71023534025266611
oct110526327005731
918611683553738
104993761151961
111655929a8a6aa
126879a860a075
132a2ba968baca
141339b0d61a41
1589d74b58dab
hex48ab35c0bd9

4993761151961 has 2 divisors, whose sum is σ = 4993761151962. Its totient is φ = 4993761151960.

The previous prime is 4993761151889. The next prime is 4993761151969. The reversal of 4993761151961 is 1691511673994.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 2861121505225 + 2132639646736 = 1691485^2 + 1460356^2 .

It is a cyclic number.

It is not a de Polignac number, because 4993761151961 - 214 = 4993761135577 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

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

Almost surely, 24993761151961 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 11022480, while the sum is 62.

The spelling of 4993761151961 in words is "four trillion, nine hundred ninety-three billion, seven hundred sixty-one million, one hundred fifty-one thousand, nine hundred sixty-one".