Search a number
-
+
51005051 = 71718381
BaseRepresentation
bin1100001010010…
…0011001111011
310112222022202222
43002210121323
5101024130201
65021114255
71156351526
oct302443173
9115868688
1051005051
1126877939
12150b898b
13a74aa06
146ab9bbd
15472791b
hex30a467b

51005051 has 4 divisors (see below), whose sum is σ = 51723504. Its totient is φ = 50286600.

The previous prime is 51005039. The next prime is 51005057. The reversal of 51005051 is 15050015.

51005051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 51005051 - 210 = 51004027 is a prime.

It is a Duffinian number.

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

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

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

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

Almost surely, 251005051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 718452.

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

The square root of 51005051 is about 7141.7820605224. The cubic root of 51005051 is about 370.8552191883.

Adding to 51005051 its reverse (15050015), we get a palindrome (66055066).

The spelling of 51005051 in words is "fifty-one million, five thousand, fifty-one".

Divisors: 1 71 718381 51005051