Search a number
-
+
50061151 = 745715649
BaseRepresentation
bin1011111011110…
…1111101011111
310111012100222201
42332331331133
5100303424101
64544552331
71145340610
oct276757537
9114170881
1050061151
1126292758
12149226a7
13a4aa1aa
146911c07
1545dce01
hex2fbdf5f

50061151 has 8 divisors (see below), whose sum is σ = 57341600. Its totient is φ = 42812928.

The previous prime is 50061149. The next prime is 50061173. The reversal of 50061151 is 15116005.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 50061151 - 21 = 50061149 is a prime.

It is a super-2 number, since 2×500611512 = 5012237678889602, which contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4626 + ... + 11023.

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

Almost surely, 250061151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 16113.

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

The square root of 50061151 is about 7075.3905192576. The cubic root of 50061151 is about 368.5532768180.

Adding to 50061151 its reverse (15116005), we get a palindrome (65177156).

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

Divisors: 1 7 457 3199 15649 109543 7151593 50061151