Search a number
-
+
3926727490601 is a prime number
BaseRepresentation
bin111001001001000011001…
…100100111110000101001
3111220101120101112120002202
4321021003030213300221
51003313414214144401
612203525205505545
7553460652645536
oct71110314476051
914811511476082
103926727490601
111284352331883
125350391122b5
1322639a6a57b6
14d80a9c65d8d
156c22342706b
hex39243327c29

3926727490601 has 2 divisors, whose sum is σ = 3926727490602. Its totient is φ = 3926727490600.

The previous prime is 3926727490591. The next prime is 3926727490603. The reversal of 3926727490601 is 1060947276293.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 3814693359376 + 112034131225 = 1953124^2 + 334715^2 .

It is a cyclic number.

It is not a de Polignac number, because 3926727490601 - 234 = 3909547621417 is a prime.

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

It is a Chen prime.

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

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

Almost surely, 23926727490601 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 3926727490601 in words is "three trillion, nine hundred twenty-six billion, seven hundred twenty-seven million, four hundred ninety thousand, six hundred one".