Search a number
-
+
10150397 is a prime number
BaseRepresentation
bin100110101110…
…000111111101
3201002200201122
4212232013331
510044303042
61001320325
7152163665
oct46560775
921080648
1010150397
115803164
1234960a5
13214516a
1414c31a5
15d577d2
hex9ae1fd

10150397 has 2 divisors, whose sum is σ = 10150398. Its totient is φ = 10150396.

The previous prime is 10150379. The next prime is 10150409. The reversal of 10150397 is 79305101.

Together with previous prime (10150379) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7806436 + 2343961 = 2794^2 + 1531^2 .

It is a cyclic number.

It is not a de Polignac number, because 10150397 - 26 = 10150333 is a prime.

It is a congruent number.

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

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

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

Almost surely, 210150397 is an apocalyptic number.

It is an amenable number.

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

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

10150397 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 10150397 is about 3185.9687694640. The cubic root of 10150397 is about 216.5181675414.

Adding to 10150397 its reverse (79305101), we get a palindrome (89455498).

The spelling of 10150397 in words is "ten million, one hundred fifty thousand, three hundred ninety-seven".