10661533039 has 2 divisors, whose sum is σ = 10661533040. Its totient is φ = 10661533038.

The previous prime is 10661532997. The next prime is 10661533073. The reversal of 10661533039 is 93033516601.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10661533039 - 2⁷ = 10661532911 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 2^10661533039 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 43740, while the sum is 37.

The spelling of 10661533039 in words is "ten billion, six hundred sixty-one million, five hundred thirty-three thousand, thirty-nine".