Search a number
-
+
631106560613 is a prime number
BaseRepresentation
bin10010010111100001110…
…00011110001001100101
32020022222220100001122202
421023300320132021211
540320001234414423
61201532031504245
763411260153054
oct11136070361145
92208886301582
10631106560613
11223718222a31
12a2390388085
134768935c4a9
142278d65839b
151163abc6728
hex92f0e1e265

631106560613 has 2 divisors, whose sum is σ = 631106560614. Its totient is φ = 631106560612.

The previous prime is 631106560561. The next prime is 631106560631. The reversal of 631106560613 is 316065601136.

It is a happy number.

Together with next prime (631106560631) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 419564516644 + 211542043969 = 647738^2 + 459937^2 .

It is a cyclic number.

It is not a de Polignac number, because 631106560613 - 228 = 630838125157 is a prime.

It is a congruent number.

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

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

Almost surely, 2631106560613 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 58320, while the sum is 38.

The spelling of 631106560613 in words is "six hundred thirty-one billion, one hundred six million, five hundred sixty thousand, six hundred thirteen".