Search a number
-
+
51150640321 = 114650058211
BaseRepresentation
bin101111101000110100…
…001101010011000001
311220000202221202102001
4233220310031103001
51314224030442241
635255343424001
73460363161154
oct575064152301
9156022852361
1051150640321
111a769226170
129ab62b5001
134a922713a1
142693491c9b
1514e58d0431
hexbe8d0d4c1

51150640321 has 4 divisors (see below), whose sum is σ = 55800698544. Its totient is φ = 46500582100.

The previous prime is 51150640241. The next prime is 51150640339. The reversal of 51150640321 is 12304605115.

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.

It is a cyclic number.

It is not a de Polignac number, because 51150640321 - 231 = 49003156673 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 51150640321.

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

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

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

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

Almost surely, 251150640321 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 4650058222.

The product of its (nonzero) digits is 3600, while the sum is 28.

The spelling of 51150640321 in words is "fifty-one billion, one hundred fifty million, six hundred forty thousand, three hundred twenty-one".

Divisors: 1 11 4650058211 51150640321