Search a number
-
+
51590371 = 710768879
BaseRepresentation
bin1100010011001…
…1010011100011
310121002001200111
43010303103203
5101201342441
65041432151
71164340150
oct304632343
9117061614
1051590371
1127137678
121533b657
13a8c4261
146bcd227
1547e1081
hex31334e3

51590371 has 8 divisors (see below), whose sum is σ = 59512320. Its totient is φ = 43806408.

The previous prime is 51590353. The next prime is 51590387. The reversal of 51590371 is 17309515.

51590371 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 51590371 - 27 = 51590243 is a prime.

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

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

Almost surely, 251590371 is an apocalyptic number.

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

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

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

The sum of its prime factors is 68993.

The product of its (nonzero) digits is 4725, while the sum is 31.

The square root of 51590371 is about 7182.6437333338. The cubic root of 51590371 is about 372.2684379766.

Adding to 51590371 its reverse (17309515), we get a palindrome (68899886).

The spelling of 51590371 in words is "fifty-one million, five hundred ninety thousand, three hundred seventy-one".

Divisors: 1 7 107 749 68879 482153 7370053 51590371