Search a number
-
+
20005756253111 is a prime number
BaseRepresentation
bin1001000110001111100111…
…11111101011001110110111
32121211112100112212110110102
410203013303333223032313
510110233242100044421
6110314303442344315
74133240201250626
oct443076377531667
977745315773412
1020005756253111
116413436946212
1222b12bb35b09b
13b216c4a19375
144d23d893b6bd
1524a5e03c260b
hex1231f3feb3b7

20005756253111 has 2 divisors, whose sum is σ = 20005756253112. Its totient is φ = 20005756253110.

The previous prime is 20005756253089. The next prime is 20005756253149. The reversal of 20005756253111 is 11135265750002.

It is an a-pointer prime, because the next prime (20005756253149) can be obtained adding 20005756253111 to its sum of digits (38).

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 20005756253111 - 26 = 20005756253047 is a prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (29) of ones.

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

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

Almost surely, 220005756253111 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 63000, while the sum is 38.

The spelling of 20005756253111 in words is "twenty trillion, five billion, seven hundred fifty-six million, two hundred fifty-three thousand, one hundred eleven".