Search a number
-
+
40643065157771 is a prime number
BaseRepresentation
bin10010011110110111100110…
…11101100001100010001011
312022220102212002110202022002
421033123303131201202023
520311343444140022041
6222235055534221215
711363236020513416
oct1117336335414213
9168812762422262
1040643065157771
1111a4a6997a004a
124684a9435480b
13198a81732353b
14a071c6054b7d
154a73456d659b
hex24f6f376188b

40643065157771 has 2 divisors, whose sum is σ = 40643065157772. Its totient is φ = 40643065157770.

The previous prime is 40643065157753. The next prime is 40643065157777. The reversal of 40643065157771 is 17775156034604.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 40643065157771 - 210 = 40643065156747 is a prime.

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

It is a Sophie Germain prime.

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

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

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

Almost surely, 240643065157771 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 14817600, while the sum is 56.

The spelling of 40643065157771 in words is "forty trillion, six hundred forty-three billion, sixty-five million, one hundred fifty-seven thousand, seven hundred seventy-one".