Search a number
-
+
51050060150 = 2521021001203
BaseRepresentation
bin101111100010110100…
…100001100101110110
311212202202200202100112
4233202310201211312
51314022303411100
635241351543022
73455032231415
oct574264414566
9155682622315
1051050060150
111a717478861
129a8868aa72
134a774867ab
142683d8d47c
1514dbb63b35
hexbe2d21976

51050060150 has 12 divisors (see below), whose sum is σ = 94953111972. Its totient is φ = 20420024040.

The previous prime is 51050060119. The next prime is 51050060203. The reversal of 51050060150 is 5106005015.

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

It is a Curzon number.

It is a congruent number.

It is an unprimeable number.

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 5 ways as a sum of consecutive naturals, for example, 510500552 + ... + 510500651.

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

Almost surely, 251050060150 is an apocalyptic number.

51050060150 is a gapful number since it is divisible by the number (50) formed by its first and last digit.

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

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

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

The sum of its prime factors is 1021001215 (or 1021001210 counting only the distinct ones).

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

Adding to 51050060150 its reverse (5106005015), we get a palindrome (56156065165).

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

Divisors: 1 2 5 10 25 50 1021001203 2042002406 5105006015 10210012030 25525030075 51050060150