Search a number
-
+
20037147622957 is a prime number
BaseRepresentation
bin1001000111001010000110…
…00100001111111000101101
32121221112101021021021110001
410203211003010033320231
510111242034242413312
6110340534420344301
74135431124426423
oct443450304177055
977845337237401
1020037147622957
116425785513a83
1222b7400245091
13b2465842aa1a
144d3b35a8d113
1524b32b239057
hex12394310fe2d

20037147622957 has 2 divisors, whose sum is σ = 20037147622958. Its totient is φ = 20037147622956.

The previous prime is 20037147622907. The next prime is 20037147623029. The reversal of 20037147622957 is 75922674173002.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10931877582921 + 9105270040036 = 3306339^2 + 3017494^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

Almost surely, 220037147622957 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 8890560, while the sum is 55.

The spelling of 20037147622957 in words is "twenty trillion, thirty-seven billion, one hundred forty-seven million, six hundred twenty-two thousand, nine hundred fifty-seven".