Search a number
-
+
51155601013 = 114650509183
BaseRepresentation
bin101111101001000111…
…001000011001110101
311220001010021210012101
4233221013020121311
51314231313213023
635300042022101
73460453301626
oct575107103165
9156033253171
1051155601013
111a771004210
129ab7aa7931
134a932ba2ca
142693dc3a4d
1514e60601ad
hexbe91c8675

51155601013 has 4 divisors (see below), whose sum is σ = 55806110208. Its totient is φ = 46505091820.

The previous prime is 51155600981. The next prime is 51155601019. The reversal of 51155601013 is 31010655115.

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 not a de Polignac number, because 51155601013 - 25 = 51155600981 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 (51155601019) by changing a digit.

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

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

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

Almost surely, 251155601013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 4650509194.

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

The spelling of 51155601013 in words is "fifty-one billion, one hundred fifty-five million, six hundred one thousand, thirteen".

Divisors: 1 11 4650509183 51155601013