10150937 has 2 divisors, whose sum is σ = 10150938. Its totient is φ = 10150936.

The previous prime is 10150901. The next prime is 10150951. The reversal of 10150937 is 73905101.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9339136 + 811801 = 3056^2 + 901^2 .

It is a cyclic number.

It is not a de Polignac number, because 10150937 - 2⁸ = 10150681 is a prime.

It is a Chen prime.

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

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

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

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

Almost surely, 2^10150937 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 945, while the sum is 26.

The square root of 10150937 is about 3186.0535149303. The cubic root of 10150937 is about 216.5220070541.

The spelling of 10150937 in words is "ten million, one hundred fifty thousand, nine hundred thirty-seven".