Search a number
-
+
31506351260513 is a prime number
BaseRepresentation
bin1110010100111101001001…
…11000000000001101100001
311010112222101210100100201112
413022132210320000031201
513112200001410314023
6151001452402313105
76431154520010243
oct712364470001541
9133488353310645
1031506351260513
11a04784aa10478
12364a185358795
13147706162946c
147accb6340093
15399844a43478
hex1ca7a4e00361

31506351260513 has 2 divisors, whose sum is σ = 31506351260514. Its totient is φ = 31506351260512.

The previous prime is 31506351260429. The next prime is 31506351260537. The reversal of 31506351260513 is 31506215360513.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 24647729763904 + 6858621496609 = 4964648^2 + 2618897^2 .

It is a cyclic number.

It is not a de Polignac number, because 31506351260513 - 28 = 31506351260257 is a prime.

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

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

Almost surely, 231506351260513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 243000, while the sum is 41.

The spelling of 31506351260513 in words is "thirty-one trillion, five hundred six billion, three hundred fifty-one million, two hundred sixty thousand, five hundred thirteen".