Search a number
-
+
3930129110489 is a prime number
BaseRepresentation
bin111001001100001101111…
…100110001010111011001
3111220201100110021202100112
4321030031330301113121
51003342401023013424
612205250522214105
7553641156150641
oct71141574612731
914821313252315
103930129110489
11128583847418a
12535828354335
132267c0347a2a
14d830d935521
156c371d9e60e
hex3930df315d9

3930129110489 has 2 divisors, whose sum is σ = 3930129110490. Its totient is φ = 3930129110488.

The previous prime is 3930129110477. The next prime is 3930129110513. The reversal of 3930129110489 is 9840119210393.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 3842415403264 + 87713707225 = 1960208^2 + 296165^2 .

It is a cyclic number.

It is not a de Polignac number, because 3930129110489 - 28 = 3930129110233 is a prime.

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

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

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

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

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

Almost surely, 23930129110489 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 419904, while the sum is 50.

The spelling of 3930129110489 in words is "three trillion, nine hundred thirty billion, one hundred twenty-nine million, one hundred ten thousand, four hundred eighty-nine".