Search a number
-
+
50032397 is a prime number
BaseRepresentation
bin1011111011011…
…0111100001101
310111010220112202
42332312330031
5100302014042
64544211245
71145161022
oct276667415
9114126482
1050032397
1126273098
1214909b25
13a49a08c
146905549
1545d4632
hex2fb6f0d

50032397 has 2 divisors, whose sum is σ = 50032398. Its totient is φ = 50032396.

The previous prime is 50032379. The next prime is 50032403. The reversal of 50032397 is 79323005.

Together with previous prime (50032379) 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., 39702601 + 10329796 = 6301^2 + 3214^2 .

It is a cyclic number.

It is not a de Polignac number, because 50032397 - 28 = 50032141 is a prime.

It is a Chen prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (50032327) 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 as a sum of consecutive naturals, namely, 25016198 + 25016199.

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

Almost surely, 250032397 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5670, while the sum is 29.

The square root of 50032397 is about 7073.3582547472. The cubic root of 50032397 is about 368.4827003975.

The spelling of 50032397 in words is "fifty million, thirty-two thousand, three hundred ninety-seven".