10559373546959 has 2 divisors, whose sum is σ = 10559373546960. Its totient is φ = 10559373546958.

The previous prime is 10559373546901. The next prime is 10559373546973. The reversal of 10559373546959 is 95964537395501.

It is a strong prime.

It is a cyclic number.

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

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

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

It is a congruent number.

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

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

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

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

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

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

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

The product of its (nonzero) digits is 688905000, while the sum is 71.

The spelling of 10559373546959 in words is "ten trillion, five hundred fifty-nine billion, three hundred seventy-three million, five hundred forty-six thousand, nine hundred fifty-nine".