Search a number
-
+
40311505133 is a prime number
BaseRepresentation
bin100101100010110000…
…001100000011101101
310212001101012122012122
4211202300030003231
51130024221131013
630304023242325
72624646066014
oct454260140355
9125041178178
1040311505133
11161068804a9
1279902a93a5
133a5577b023
141d45ad7a7b
1510ae019a08
hex962c0c0ed

40311505133 has 2 divisors, whose sum is σ = 40311505134. Its totient is φ = 40311505132.

The previous prime is 40311505099. The next prime is 40311505159. The reversal of 40311505133 is 33150511304.

It is an a-pointer prime, because the next prime (40311505159) can be obtained adding 40311505133 to its sum of digits (26).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 38768822404 + 1542682729 = 196898^2 + 39277^2 .

It is a cyclic number.

It is not a de Polignac number, because 40311505133 - 212 = 40311501037 is a prime.

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 (40311505193) by changing a digit.

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

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

Almost surely, 240311505133 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2700, while the sum is 26.

The spelling of 40311505133 in words is "forty billion, three hundred eleven million, five hundred five thousand, one hundred thirty-three".