10505611651 has 4 divisors (see below), whose sum is σ = 11058538600. Its totient is φ = 9952684704.

The previous prime is 10505611609. The next prime is 10505611661. The reversal of 10505611651 is 15611650501.

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

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 10505611651 - 2⁹ = 10505611139 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 2^10505611651 is an apocalyptic number.

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

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

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

The sum of its prime factors is 552926948.

The product of its (nonzero) digits is 4500, while the sum is 31.

The spelling of 10505611651 in words is "ten billion, five hundred five million, six hundred eleven thousand, six hundred fifty-one".