Search a number
-
+
20111199114959 is a prime number
BaseRepresentation
bin1001001001010100000001…
…11000010001011011001111
32122012121112001012211111222
410210222000320101123033
510114000213433134314
6110434542441033555
74143662155633211
oct444520070213317
978177461184458
1020111199114959
116454125669a47
122309827a858bb
13b2b62a055304
144d755c7c05b1
1524d212391c8e
hex124a80e116cf

20111199114959 has 2 divisors, whose sum is σ = 20111199114960. Its totient is φ = 20111199114958.

The previous prime is 20111199114943. The next prime is 20111199114967. The reversal of 20111199114959 is 95941199111102.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 20111199114959 - 24 = 20111199114943 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 20111199114959.

It is a congruent number.

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

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

Almost surely, 220111199114959 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 262440, while the sum is 53.

The spelling of 20111199114959 in words is "twenty trillion, one hundred eleven billion, one hundred ninety-nine million, one hundred fourteen thousand, nine hundred fifty-nine".