10150500270 has 32 divisors (see below), whose sum is σ = 24456009888. Its totient is φ = 2696265728.

The previous prime is 10150500253. The next prime is 10150500271. The reversal of 10150500270 is 7200505101.

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

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 2^10150500270 is an apocalyptic number.

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

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

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

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

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

The sum of its prime factors is 1316804.

The product of its (nonzero) digits is 350, while the sum is 21.

The spelling of 10150500270 in words is "ten billion, one hundred fifty million, five hundred thousand, two hundred seventy".