Search a number
-
+
20001010111051 is a prime number
BaseRepresentation
bin1001000110000110110010…
…00110100101001001001011
32121211002002210011110112011
410203003121012211021023
510110144032042023201
6110312200500200351
74133011450564024
oct443033106451113
977732083143464
1020001010111051
116411420867462
1222b03b59990b7
13b21119651198
144d20a847bc4b
1524a4138b3151
hex1230d91a524b

20001010111051 has 2 divisors, whose sum is σ = 20001010111052. Its totient is φ = 20001010111050.

The previous prime is 20001010111009. The next prime is 20001010111063. The reversal of 20001010111051 is 15011101010002.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 20001010111051 - 29 = 20001010110539 is a prime.

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

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

Almost surely, 220001010111051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 10, while the sum is 13.

Adding to 20001010111051 its reverse (15011101010002), we get a palindrome (35012111121053).

The spelling of 20001010111051 in words is "twenty trillion, one billion, ten million, one hundred eleven thousand, fifty-one".