Search a number
-
+
506311321613 is a prime number
BaseRepresentation
bin1110101111000101000…
…00011010100000001101
31210101212201002001212212
413113202200122200031
531243411144242423
61024332440440205
751402603140036
oct7274240324015
91711781061785
10506311321613
111857a85a5879
1282162779065
133898b8798c6
141a711511a8d
15d284c64578
hex75e281a80d

506311321613 has 2 divisors, whose sum is σ = 506311321614. Its totient is φ = 506311321612.

The previous prime is 506311321561. The next prime is 506311321619. The reversal of 506311321613 is 316123113605.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 487520943529 + 18790378084 = 698227^2 + 137078^2 .

It is a cyclic number.

It is not a de Polignac number, because 506311321613 - 28 = 506311321357 is a prime.

It is a super-3 number, since 3×5063113216133 (a number of 36 digits) contains 333 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 506311321613.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 2506311321613 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9720, while the sum is 32.

The spelling of 506311321613 in words is "five hundred six billion, three hundred eleven million, three hundred twenty-one thousand, six hundred thirteen".