Search a number
-
+
39754051549067 is a prime number
BaseRepresentation
bin10010000100111111101100…
…00111101111011110001011
312012202110011012112011200002
421002133312013233132023
520202312244144032232
6220314431551233215
711242064312516252
oct1102376607573613
9165673135464602
1039754051549067
1111737664793689
12456072751880b
131924a38a087ab
149b616bbd9799
1548e16295bb62
hex2427f61ef78b

39754051549067 has 2 divisors, whose sum is σ = 39754051549068. Its totient is φ = 39754051549066.

The previous prime is 39754051549049. The next prime is 39754051549109. The reversal of 39754051549067 is 76094515045793.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 39754051549067 - 242 = 35356005037963 is a prime.

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

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

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

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

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

Almost surely, 239754051549067 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 142884000, while the sum is 65.

The spelling of 39754051549067 in words is "thirty-nine trillion, seven hundred fifty-four billion, fifty-one million, five hundred forty-nine thousand, sixty-seven".