Search a number
-
+
20001100109923 is a prime number
BaseRepresentation
bin1001000110000110111100…
…11101111001100001100011
32121211002100001111212202201
410203003132131321201203
510110144223112004143
6110312213433154031
74133013622553302
oct443033635714143
977732301455681
1020001100109923
116411467647999
1222b041bb5b917
13b211321a275a
144d20b63c8439
1524a41b73e64d
hex1230de779863

20001100109923 has 2 divisors, whose sum is σ = 20001100109924. Its totient is φ = 20001100109922.

The previous prime is 20001100109897. The next prime is 20001100110007. The reversal of 20001100109923 is 32990100110002.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 20001100109923 - 25 = 20001100109891 is a prime.

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

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

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

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

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

Almost surely, 220001100109923 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 972, while the sum is 28.

Adding to 20001100109923 its reverse (32990100110002), we get a palindrome (52991200219925).

The spelling of 20001100109923 in words is "twenty trillion, one billion, one hundred million, one hundred nine thousand, nine hundred twenty-three".