Search a number
-
+
3895002514661 is a prime number
BaseRepresentation
bin111000101011100000001…
…111011100010011100101
3111210100200102101210120212
4320223200033130103211
51002303431120432121
612141201153305205
7551255536052366
oct70534017342345
914710612353525
103895002514661
1112719524168a5
1252aa64565205
132233b2b2ab9b
14d673a6b3b6d
156b4b816425b
hex38ae03dc4e5

3895002514661 has 2 divisors, whose sum is σ = 3895002514662. Its totient is φ = 3895002514660.

The previous prime is 3895002514619. The next prime is 3895002514681. The reversal of 3895002514661 is 1664152005983.

3895002514661 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 3885310112161 + 9692402500 = 1971119^2 + 98450^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-3895002514661 is a prime.

It is a congruent number.

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

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

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

Almost surely, 23895002514661 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 3895002514661 in words is "three trillion, eight hundred ninety-five billion, two million, five hundred fourteen thousand, six hundred sixty-one".