Search a number
-
+
40055352437 is a prime number
BaseRepresentation
bin100101010011011111…
…000010110001110101
310211101112012201202202
4211103133002301311
51124013132234222
630222353114245
72615415610112
oct452337026165
9124345181682
1040055352437
1115a95225161
12791a558985
133a14692c99
141d1da99909
1510967bc892
hex9537c2c75

40055352437 has 2 divisors, whose sum is σ = 40055352438. Its totient is φ = 40055352436.

The previous prime is 40055352397. The next prime is 40055352473. The reversal of 40055352437 is 73425355004.

Together with next prime (40055352473) 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., 29544796996 + 10510555441 = 171886^2 + 102521^2 .

It is a cyclic number.

It is not a de Polignac number, because 40055352437 - 226 = 39988243573 is a prime.

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

It is a congruent number.

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

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

Almost surely, 240055352437 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 40055352437 in words is "forty billion, fifty-five million, three hundred fifty-two thousand, four hundred thirty-seven".