Search a number
-
+
20117105576569 is a prime number
BaseRepresentation
bin1001001001011111000001…
…11011101000101001111001
32122020011202200021011122101
410210233200323220221321
510114044313011422234
6110441400513023401
74144261426011001
oct444574073505171
978204680234571
1020117105576569
116456686711a81
12230a9b5b54b61
13b2c05b930701
144d795d001001
1524d45ab9e814
hex124be0ee8a79

20117105576569 has 2 divisors, whose sum is σ = 20117105576570. Its totient is φ = 20117105576568.

The previous prime is 20117105576563. The next prime is 20117105576647. The reversal of 20117105576569 is 96567550171102.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 15946884156025 + 4170221420544 = 3993355^2 + 2042112^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-20117105576569 is a prime.

It is a super-2 number, since 2×201171055765692 (a number of 27 digits) contains 22 as substring.

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

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

Almost surely, 220117105576569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3969000, while the sum is 55.

The spelling of 20117105576569 in words is "twenty trillion, one hundred seventeen billion, one hundred five million, five hundred seventy-six thousand, five hundred sixty-nine".