10500011050 has 24 divisors (see below), whose sum is σ = 19550602476. Its totient is φ = 4195578240.

The previous prime is 10500011033. The next prime is 10500011057. The reversal of 10500011050 is 5011000501.

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

It can be written as a sum of positive squares in 6 ways, for example, as 3219314121 + 7280696929 = 56739^2 + 85327^2 .

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

It is a self number, because there is not a number n which added to its sum of digits gives 10500011050.

It is not an unprimeable number, because it can be changed into a prime (10500011057) 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 11 ways as a sum of consecutive naturals, for example, 62529 + ... + 157828.

Almost surely, 2^10500011050 is an apocalyptic number.

10500011050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

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

The product of its (nonzero) digits is 25, while the sum is 13.

Adding to 10500011050 its reverse (5011000501), we get a palindrome (15511011551).

The spelling of 10500011050 in words is "ten billion, five hundred million, eleven thousand, fifty".