Search a number
-
+
3914056625641 is a prime number
BaseRepresentation
bin111000111101001111111…
…101000110110111101001
3111212011212100001221000221
4320331033331012313221
51003111441444010031
612154032013130041
7552531654244351
oct70751775066751
914764770057027
103914056625641
111279a3aa20458
125326a1789921
1322512b562c76
14d76270d5b61
156bc30d3ba11
hex38f4ff46de9

3914056625641 has 2 divisors, whose sum is σ = 3914056625642. Its totient is φ = 3914056625640.

The previous prime is 3914056625617. The next prime is 3914056625651. The reversal of 3914056625641 is 1465266504193.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 3711710496400 + 202346129241 = 1926580^2 + 449829^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 3914056625641 - 27 = 3914056625513 is a prime.

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

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

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

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

Almost surely, 23914056625641 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4665600, while the sum is 52.

The spelling of 3914056625641 in words is "three trillion, nine hundred fourteen billion, fifty-six million, six hundred twenty-five thousand, six hundred forty-one".