Search a number
-
+
12650656637 is a prime number
BaseRepresentation
bin10111100100000100…
…11011001101111101
31012122122102221110102
423302002123031331
5201402032003022
65451151250445
7625331543603
oct136202331575
935578387412
1012650656637
115401a69633
122550819a25
131267bb8658
148801cd873
154e0947a92
hex2f209b37d

12650656637 has 2 divisors, whose sum is σ = 12650656638. Its totient is φ = 12650656636.

The previous prime is 12650656537. The next prime is 12650656649. The reversal of 12650656637 is 73665605621.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 12006461476 + 644195161 = 109574^2 + 25381^2 .

It is a cyclic number.

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

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

It is a junction number, because it is equal to n+sod(n) for n = 12650656591 and 12650656600.

It is a congruent number.

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

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

Almost surely, 212650656637 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1360800, while the sum is 47.

The spelling of 12650656637 in words is "twelve billion, six hundred fifty million, six hundred fifty-six thousand, six hundred thirty-seven".