10477002536 has 128 divisors (see below), whose sum is σ = 26748610560. Its totient is φ = 3714681600.

The previous prime is 10477002533. The next prime is 10477002617. The reversal of 10477002536 is 63520077401.

10477002536 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a super-3 number, since 3×10477002536³ (a number of 31 digits) contains 333 as substring.

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

It is not an unprimeable number, because it can be changed into a prime (10477002533) 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 in 31 ways as a sum of consecutive naturals, for example, 559355 + ... + 577781.

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

Almost surely, 2^10477002536 is an apocalyptic number.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 10477002536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13374305280).

10477002536 is an abundant number, since it is smaller than the sum of its proper divisors (16271608024).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

10477002536 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 18535 (or 18531 counting only the distinct ones).

The product of its (nonzero) digits is 35280, while the sum is 35.

Adding to 10477002536 its reverse (63520077401), we get a palindrome (73997079937).

The spelling of 10477002536 in words is "ten billion, four hundred seventy-seven million, two thousand, five hundred thirty-six".