Search a number
-
+
20115689361401 is a prime number
BaseRepresentation
bin1001001001011100011001…
…00001001100111111111001
32122020001002222101222122202
410210232030201030333321
510114033412434031101
6110441004202355545
74144211351251544
oct444561441147771
978201088358582
1020115689361401
11645601a258617
12230a67b7bbbb5
13b2bb943c547a
144d7866cab85b
1524d3c66a536b
hex124b8c84cff9

20115689361401 has 2 divisors, whose sum is σ = 20115689361402. Its totient is φ = 20115689361400.

The previous prime is 20115689361377. The next prime is 20115689361407. The reversal of 20115689361401 is 10416398651102.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 20001252620176 + 114436741225 = 4472276^2 + 338285^2 .

It is a cyclic number.

It is not a de Polignac number, because 20115689361401 - 26 = 20115689361337 is a prime.

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

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

Almost surely, 220115689361401 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 311040, while the sum is 47.

The spelling of 20115689361401 in words is "twenty trillion, one hundred fifteen billion, six hundred eighty-nine million, three hundred sixty-one thousand, four hundred one".