Search a number
-
+
50060051 = 97569907
BaseRepresentation
bin1011111011110…
…1101100010011
310111012022110222
42332331230103
5100303410201
64544543255
71145334446
oct276755423
9114168428
1050060051
1126291948
1214921b2b
13a4a9842
14691165d
1545dc91b
hex2fbdb13

50060051 has 8 divisors (see below), whose sum is σ = 50720880. Its totient is φ = 49402368.

The previous prime is 50060047. The next prime is 50060063. The reversal of 50060051 is 15006005.

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 50060051 - 22 = 50060047 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (50060081) 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 in 7 ways as a sum of consecutive naturals, for example, 54740 + ... + 55646.

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

Almost surely, 250060051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1573.

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

The square root of 50060051 is about 7075.3127846054. The cubic root of 50060051 is about 368.5505773757.

Adding to 50060051 its reverse (15006005), we get a palindrome (65066056).

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

Divisors: 1 97 569 907 55193 87979 516083 50060051