Search a number
-
+
12674606350669 is a prime number
BaseRepresentation
bin1011100001110000100101…
…1010001100000101001101
31122212200101002221110100121
42320130021122030011031
53130130043211210134
642542344521224541
72445465363252664
oct270341132140515
948780332843317
1012674606350669
1140472a794994a
121508510032151
1370c296bc6503
1431b650549ddb
1516ea67998ab4
hexb870968c14d

12674606350669 has 2 divisors, whose sum is σ = 12674606350670. Its totient is φ = 12674606350668.

The previous prime is 12674606350643. The next prime is 12674606350753. The reversal of 12674606350669 is 96605360647621.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 7434009465444 + 5240596885225 = 2726538^2 + 2289235^2 .

It is a cyclic number.

It is not a de Polignac number, because 12674606350669 - 213 = 12674606342477 is a prime.

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

It is a congruent number.

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

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

Almost surely, 212674606350669 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 58786560, while the sum is 61.

The spelling of 12674606350669 in words is "twelve trillion, six hundred seventy-four billion, six hundred six million, three hundred fifty thousand, six hundred sixty-nine".