Search a number
-
+
39504720313 is a prime number
BaseRepresentation
bin100100110010101010…
…100011000110111001
310202222011002201111101
4210302222203012321
51121401202022223
630052003131401
72565651403462
oct446252430671
9122864081441
1039504720313
1115832426093
1277a6073b61
133957590b66
141caa8c3d69
1510632a24ad
hex932aa31b9

39504720313 has 2 divisors, whose sum is σ = 39504720314. Its totient is φ = 39504720312.

The previous prime is 39504720289. The next prime is 39504720331. The reversal of 39504720313 is 31302740593.

It is a happy number.

Together with next prime (39504720331) 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., 22694819904 + 16809900409 = 150648^2 + 129653^2 .

It is a cyclic number.

It is not a de Polignac number, because 39504720313 - 221 = 39502623161 is a prime.

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

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

Almost surely, 239504720313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 68040, while the sum is 37.

The spelling of 39504720313 in words is "thirty-nine billion, five hundred four million, seven hundred twenty thousand, three hundred thirteen".