Search a number
-
+
40625343431 is a prime number
BaseRepresentation
bin100101110101011101…
…011000101111000111
310212212020202021102022
4211311131120233013
51131200041442211
630355114033355
72635506502331
oct456535305707
9125766667368
1040625343431
1116257a468a2
127a5941885b
133aa57b276a
141d75670451
1510cb85dbdb
hex975758bc7

40625343431 has 2 divisors, whose sum is σ = 40625343432. Its totient is φ = 40625343430.

The previous prime is 40625343413. The next prime is 40625343439. The reversal of 40625343431 is 13434352604.

Together with previous prime (40625343413) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

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

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

It is a Sophie Germain prime.

It is a junction number, because it is equal to n+sod(n) for n = 40625343391 and 40625343400.

It is a congruent number.

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

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

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

Almost surely, 240625343431 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 103680, while the sum is 35.

The spelling of 40625343431 in words is "forty billion, six hundred twenty-five million, three hundred forty-three thousand, four hundred thirty-one".