Search a number
-
+
20343665111569 is a prime number
BaseRepresentation
bin1001010000000101000001…
…11011101011001000010001
32200000211120000000000210021
410220002200323223020101
510131302311232032234
6111133430054103441
74166531662203442
oct450024073531021
980024500000707
1020343665111569
1165337776629a8
1223468a434ab81
13b475265c1767
145048d26292c9
152542baba09b4
hex1280a0eeb211

20343665111569 has 2 divisors, whose sum is σ = 20343665111570. Its totient is φ = 20343665111568.

The previous prime is 20343665111507. The next prime is 20343665111591. The reversal of 20343665111569 is 96511156634302.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 19079974371969 + 1263690739600 = 4368063^2 + 1124140^2 .

It is a cyclic number.

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

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

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 220343665111569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3499200, while the sum is 52.

The spelling of 20343665111569 in words is "twenty trillion, three hundred forty-three billion, six hundred sixty-five million, one hundred eleven thousand, five hundred sixty-nine".