Search a number
-
+
51612011 = 114692001
BaseRepresentation
bin1100010011100…
…0100101101011
310121010011100222
43010320211223
5101203041021
65042120255
71164460223
oct304704553
9117104328
1051612011
1127151960
121535008b
13a901069
146bd7083
1547e76ab
hex313896b

51612011 has 4 divisors (see below), whose sum is σ = 56304024. Its totient is φ = 46920000.

The previous prime is 51612007. The next prime is 51612031. The reversal of 51612011 is 11021615.

51612011 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 51612011 - 22 = 51612007 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (51612031) 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, 2345990 + ... + 2346011.

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

Almost surely, 251612011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 4692012.

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

The square root of 51612011 is about 7184.1499845145. The cubic root of 51612011 is about 372.3204810403.

Adding to 51612011 its reverse (11021615), we get a palindrome (62633626).

The spelling of 51612011 in words is "fifty-one million, six hundred twelve thousand, eleven".

Divisors: 1 11 4692001 51612011