Search a number
-
+
51050060151 = 317016686717
BaseRepresentation
bin101111100010110100…
…100001100101110111
311212202202200202100120
4233202310201211313
51314022303411101
635241351543023
73455032231416
oct574264414567
9155682622316
1051050060151
111a717478862
129a8868aa73
134a774867ac
142683d8d47d
1514dbb63b36
hexbe2d21977

51050060151 has 4 divisors (see below), whose sum is σ = 68066746872. Its totient is φ = 34033373432.

The previous prime is 51050060119. The next prime is 51050060203. The reversal of 51050060151 is 15106005015.

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

It is a cyclic number.

It is not a de Polignac number, because 51050060151 - 25 = 51050060119 is a prime.

It is a super-2 number, since 2×510500601512 (a number of 22 digits) contains 22 as substring.

It is a congruent number.

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

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

Almost surely, 251050060151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 17016686720.

The product of its (nonzero) digits is 750, while the sum is 24.

Adding to 51050060151 its reverse (15106005015), we get a palindrome (66156065166).

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

Divisors: 1 3 17016686717 51050060151