Search a number
-
+
40485702557 is a prime number
BaseRepresentation
bin100101101101001000…
…101100101110011101
310212111111222210011002
4211231020230232131
51130403314440212
630333205040045
72632162536146
oct455510545635
9125444883132
1040485702557
111619613a613
127a1a6b6025
133a8289ca21
141d60cc0acd
1510be478ac2
hex96d22cb9d

40485702557 has 2 divisors, whose sum is σ = 40485702558. Its totient is φ = 40485702556.

The previous prime is 40485702541. The next prime is 40485702559. The reversal of 40485702557 is 75520758404.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 21510915556 + 18974787001 = 146666^2 + 137749^2 .

It is a cyclic number.

It is not a de Polignac number, because 40485702557 - 24 = 40485702541 is a prime.

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

Together with 40485702559, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 240485702557 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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