1063760369257 has 2 divisors, whose sum is σ = 1063760369258. Its totient is φ = 1063760369256.

The previous prime is 1063760369179. The next prime is 1063760369263. The reversal of 1063760369257 is 7529630673601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1039056074281 + 24704294976 = 1019341^2 + 157176^2 .

It is a cyclic number.

It is not a de Polignac number, because 1063760369257 - 2¹¹ = 1063760367209 is a prime.

It is a super-2 number, since 2×1063760369257² (a number of 25 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 1063760369198 and 1063760369207.

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

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

Almost surely, 2^{1063760369257} is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 1063760369257 in words is "one trillion, sixty-three billion, seven hundred sixty million, three hundred sixty-nine thousand, two hundred fifty-seven".