Search a number
-
+
51606015051 = 317202005017
BaseRepresentation
bin110000000011111101…
…010100110001001011
311221012111211012002210
4300003331110301023
51321142114440201
635412452000203
73504562614243
oct600375246113
9157174735083
1051606015051
111a982282a18
12a002900063
134b357005a6
1426d7b4cb23
1515208811d6
hexc03f54c4b

51606015051 has 4 divisors (see below), whose sum is σ = 68808020072. Its totient is φ = 34404010032.

The previous prime is 51606015037. The next prime is 51606015061. The reversal of 51606015051 is 15051060615.

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

It is not a de Polignac number, because 51606015051 - 218 = 51605752907 is a prime.

It is a Duffinian number.

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

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

Almost surely, 251606015051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 17202005020.

The product of its (nonzero) digits is 4500, while the sum is 30.

Adding to 51606015051 its reverse (15051060615), we get a palindrome (66657075666).

The spelling of 51606015051 in words is "fifty-one billion, six hundred six million, fifteen thousand, fifty-one".

Divisors: 1 3 17202005017 51606015051