Search a number
-
+
20000110231027 is a prime number
BaseRepresentation
bin1001000110000101000110…
…11101110011110111110011
32121210222210001212211012101
410203002203131303313303
510110140211204343102
6110311531312441231
74132650242665063
oct443024335636763
977728701784171
1020000110231027
116410aa9907263
1222b01a4549217
13b2100509a2b4
144d2020b533a3
1524a3ae8abe87
hex1230a3773df3

20000110231027 has 2 divisors, whose sum is σ = 20000110231028. Its totient is φ = 20000110231026.

The previous prime is 20000110230889. The next prime is 20000110231033. The reversal of 20000110231027 is 72013201100002.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 20000110231027 - 215 = 20000110198259 is a prime.

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

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

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

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

Almost surely, 220000110231027 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 168, while the sum is 19.

Adding to 20000110231027 its reverse (72013201100002), we get a palindrome (92013311331029).

It can be divided in two parts, 200001 and 10231027, that added together give a triangular number (10431028 = T4567).

The spelling of 20000110231027 in words is "twenty trillion, one hundred ten million, two hundred thirty-one thousand, twenty-seven".