Search a number
-
+
40347662046557 is a prime number
BaseRepresentation
bin10010010110010001011000…
…00100000101010101011101
312021212012100221101212111012
421023020230010011111131
520242024002440442212
6221451243212305005
711333010451505135
oct1113105404052535
9167765327355435
1040347662046557
1111946390400398
124637792472165
1319689ca992a88
149d6ba163dac5
1549e8068a3922
hex24b22c10555d

40347662046557 has 2 divisors, whose sum is σ = 40347662046558. Its totient is φ = 40347662046556.

The previous prime is 40347662046481. The next prime is 40347662046599. The reversal of 40347662046557 is 75564026674304.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 35677075434841 + 4670586611716 = 5973029^2 + 2161154^2 .

It is a cyclic number.

It is not a de Polignac number, because 40347662046557 - 212 = 40347662042461 is a prime.

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

It is a congruent number.

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

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

Almost surely, 240347662046557 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 101606400, while the sum is 59.

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