Search a number
-
+
51501061 = 53999539
BaseRepresentation
bin1100010001110…
…1100000000101
310120220112011201
43010131200011
5101141013221
65035502501
71163515603
oct304354005
9116815151
1051501061
1127086567
12152b7a31
13a892701
146ba8873
1547c4891
hex311d805

51501061 has 4 divisors (see below), whose sum is σ = 51516000. Its totient is φ = 51486124.

The previous prime is 51501059. The next prime is 51501089. The reversal of 51501061 is 16010515.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.

It is a cyclic number.

It is not a de Polignac number, because 51501061 - 21 = 51501059 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 251501061 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 14938.

The product of its (nonzero) digits is 150, while the sum is 19.

The square root of 51501061 is about 7176.4239701957. The cubic root of 51501061 is about 372.0534980099.

Adding to 51501061 its reverse (16010515), we get a palindrome (67511576).

The spelling of 51501061 in words is "fifty-one million, five hundred one thousand, sixty-one".

Divisors: 1 5399 9539 51501061