Search a number
-
+
51062137 = 740118191
BaseRepresentation
bin1100001011001…
…0010101111001
310120002020002021
43002302111321
5101032442022
65022234441
71160010130
oct302622571
9116066067
1051062137
1126906815
1215125a21
13a76a9a9
146ad2917
1547397c7
hex30b2579

51062137 has 8 divisors (see below), whose sum is σ = 58505472. Its totient is φ = 43656000.

The previous prime is 51062129. The next prime is 51062149. The reversal of 51062137 is 73126015.

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

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 51062137 - 23 = 51062129 is a prime.

It is a Duffinian number.

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

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

Almost surely, 251062137 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 18599.

The product of its (nonzero) digits is 1260, while the sum is 25.

The square root of 51062137 is about 7145.7775644082. Note that the first 3 decimals coincide. The cubic root of 51062137 is about 370.9935241033.

The spelling of 51062137 in words is "fifty-one million, sixty-two thousand, one hundred thirty-seven".

Divisors: 1 7 401 2807 18191 127337 7294591 51062137