[go: up one dir, main page]

Search a number
-
+
51040111 = 195126161
BaseRepresentation
bin1100001010110…
…0111101101111
310120001002212111
43002230331233
5101031240421
65021544451
71156555663
oct302547557
9116032774
1051040111
11268a1211
1215115127
13a760965
146ac88a3
154732ee1
hex30acf6f

51040111 has 4 divisors (see below), whose sum is σ = 51068224. Its totient is φ = 51012000.

The previous prime is 51040081. The next prime is 51040127. The reversal of 51040111 is 11104015.

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 51040111 - 213 = 51031919 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 51040091 and 51040100.

It is a congruent number.

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

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

Almost surely, 251040111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 28112.

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

The square root of 51040111 is about 7144.2362083011. The cubic root of 51040111 is about 370.9401729051.

Adding to 51040111 its reverse (11104015), we get a palindrome (62144126).

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

Divisors: 1 1951 26161 51040111