Search a number
-
+
13565552760769 is a prime number
BaseRepresentation
bin1100010101100111100111…
…1101000001011111000001
31210000212001200210112001111
43011121321331001133001
53234224223001321034
644503532351003321
72600036020633462
oct305317175013701
953025050715044
1013565552760769
114360133975639
121631118209541
137752c2a8ac19
1434c80d36ad69
15187d10260364
hexc5679f417c1

13565552760769 has 2 divisors, whose sum is σ = 13565552760770. Its totient is φ = 13565552760768.

The previous prime is 13565552760713. The next prime is 13565552760817. The reversal of 13565552760769 is 96706725556531.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 13546117055025 + 19435705744 = 3680505^2 + 139412^2 .

It is a cyclic number.

It is not a de Polignac number, because 13565552760769 - 233 = 13556962826177 is a prime.

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

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

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

Almost surely, 213565552760769 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 357210000, while the sum is 67.

The spelling of 13565552760769 in words is "thirteen trillion, five hundred sixty-five billion, five hundred fifty-two million, seven hundred sixty thousand, seven hundred sixty-nine".