Search a number
-
+
51027131 = 132738453
BaseRepresentation
bin1100001010100…
…1110010111011
310120000110001202
43002221302323
5101030332011
65021404415
71156503101
oct302516273
9116013052
1051027131
1126892491
121510970b
13a757a8c
146ac3c71
15472e23b
hex30a9cbb

51027131 has 4 divisors (see below), whose sum is σ = 51066912. Its totient is φ = 50987352.

The previous prime is 51027121. The next prime is 51027139. The reversal of 51027131 is 13172015.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13172015 = 52634403.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-51027131 is a prime.

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

It is a Duffinian number.

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

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

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

Almost surely, 251027131 is an apocalyptic number.

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

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

51027131 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 39780.

The product of its (nonzero) digits is 210, while the sum is 20.

The square root of 51027131 is about 7143.3277259272. The cubic root of 51027131 is about 370.9087256664.

Adding to 51027131 its reverse (13172015), we get a palindrome (64199146).

The spelling of 51027131 in words is "fifty-one million, twenty-seven thousand, one hundred thirty-one".

Divisors: 1 1327 38453 51027131