Search a number
-
+
39132906581 is a prime number
BaseRepresentation
bin100100011100100000…
…001100010001010101
310202000020110121221102
4210130200030101111
51120121011002311
625551041555445
72553515134436
oct443440142125
9122006417842
1039132906581
1115661561a0a
127701645b85
1338c853ab32
141c7337948d
15104080a43b
hex91c80c455

39132906581 has 2 divisors, whose sum is σ = 39132906582. Its totient is φ = 39132906580.

The previous prime is 39132906523. The next prime is 39132906623. The reversal of 39132906581 is 18560923193.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 37812747025 + 1320159556 = 194455^2 + 36334^2 .

It is an emirp because it is prime and its reverse (18560923193) is a distict prime.

It is a cyclic number.

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

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

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

Almost surely, 239132906581 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 39132906581 in words is "thirty-nine billion, one hundred thirty-two million, nine hundred six thousand, five hundred eighty-one".