Search a number
-
+
50915141 is a prime number
BaseRepresentation
bin1100001000111…
…0011101000101
310112210202102222
43002032131011
5101013241031
65015142125
71155525434
oct302163505
9115722388
1050915141
1126816332
1215074945
13a718b04
146a9511b
15470ae7b
hex308e745

50915141 has 2 divisors, whose sum is σ = 50915142. Its totient is φ = 50915140.

The previous prime is 50915129. The next prime is 50915143. The reversal of 50915141 is 14151905.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 47128225 + 3786916 = 6865^2 + 1946^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-50915141 is a prime.

Together with 50915143, it forms a pair of twin primes.

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 50915141.

It is a congruent number.

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

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

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

Almost surely, 250915141 is an apocalyptic number.

It is an amenable number.

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

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

50915141 is an evil number, because the sum of its binary digits is even.

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

The square root of 50915141 is about 7135.4846366592. The cubic root of 50915141 is about 370.6371806239.

The spelling of 50915141 in words is "fifty million, nine hundred fifteen thousand, one hundred forty-one".