Search a number
-
+
51141131 = 53964927
BaseRepresentation
bin1100001100010…
…1101000001011
310120020020102222
43003011220023
5101043004011
65024044255
71160456336
oct303055013
9116206388
1051141131
11269600a8
121516368b
13a797932
146b1361d
154752ddb
hex30c5a0b

51141131 has 4 divisors (see below), whose sum is σ = 52106112. Its totient is φ = 50176152.

The previous prime is 51141127. The next prime is 51141137. The reversal of 51141131 is 13114115.

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 51141131 - 22 = 51141127 is a prime.

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

It is a Duffinian number.

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

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

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

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

Almost surely, 251141131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 964980.

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

The square root of 51141131 is about 7151.3027484508. The cubic root of 51141131 is about 371.1847366450.

Adding to 51141131 its reverse (13114115), we get a palindrome (64255246).

The spelling of 51141131 in words is "fifty-one million, one hundred forty-one thousand, one hundred thirty-one".

Divisors: 1 53 964927 51141131