Search a number
-
+
20111419914961 is a prime number
BaseRepresentation
bin1001001001010100011100…
…00010100011101011010001
32122012122002102200122011211
410210222032002203223101
510114001141444234321
6110435020405340121
74144000506461044
oct444521602435321
978178072618154
1020111419914961
116454229269291
122309889a07641
13b2b663a12bbb
144d757dc58c5b
1524d2269590e1
hex124a8e0a3ad1

20111419914961 has 2 divisors, whose sum is σ = 20111419914962. Its totient is φ = 20111419914960.

The previous prime is 20111419914917. The next prime is 20111419915091. The reversal of 20111419914961 is 16941991411102.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 11054088903361 + 9057331011600 = 3324769^2 + 3009540^2 .

It is a cyclic number.

It is not a de Polignac number, because 20111419914961 - 239 = 19561664101073 is a prime.

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

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

Almost surely, 220111419914961 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 139968, while the sum is 49.

The spelling of 20111419914961 in words is "twenty trillion, one hundred eleven billion, four hundred nineteen million, nine hundred fourteen thousand, nine hundred sixty-one".