Search a number
-
+
51505403051 = 113455800027
BaseRepresentation
bin101111111101111101…
…100001010010101011
311220221111111120101102
4233331331201102223
51320440340344201
635354455312015
73502231462634
oct577575412253
9156844446342
1051505403051
111a930503703
129b9507b60b
134b1a90436b
1426c863c88b
151516b0a26b
hexbfdf614ab

51505403051 has 4 divisors (see below), whose sum is σ = 51961203192. Its totient is φ = 51049602912.

The previous prime is 51505403041. The next prime is 51505403069. The reversal of 51505403051 is 15030450515.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

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

It is a Duffinian number.

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

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

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

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

Almost surely, 251505403051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 455800140.

The product of its (nonzero) digits is 7500, while the sum is 29.

Adding to 51505403051 its reverse (15030450515), we get a palindrome (66535853566).

The spelling of 51505403051 in words is "fifty-one billion, five hundred five million, four hundred three thousand, fifty-one".

Divisors: 1 113 455800027 51505403051