Search a number
-
+
50151161 = 308316267
BaseRepresentation
bin1011111101001…
…1111011111001
310111100221110102
42333103323321
5100314314121
64550525145
71146164204
oct277237371
9114327412
1050151161
1126344345
12149667b5
13a50c158
14693693b
15460990b
hex2fd3ef9

50151161 has 4 divisors (see below), whose sum is σ = 50170512. Its totient is φ = 50131812.

The previous prime is 50151137. The next prime is 50151163. The reversal of 50151161 is 16115105.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 50151161 - 222 = 45956857 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (50151163) by changing a digit.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5051 + ... + 11216.

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

Almost surely, 250151161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 19350.

The product of its (nonzero) digits is 150, while the sum is 20.

The square root of 50151161 is about 7081.7484422987. The cubic root of 50151161 is about 368.7740309533.

Adding to 50151161 its reverse (16115105), we get a palindrome (66266266).

The spelling of 50151161 in words is "fifty million, one hundred fifty-one thousand, one hundred sixty-one".

Divisors: 1 3083 16267 50151161