Search a number
-
+
51050121251 = 190126854351
BaseRepresentation
bin101111100010110100…
…110000100000100011
311212202202210212011112
4233202310300200203
51314022312340001
635241353133535
73455032604513
oct574264604043
9155682725145
1051050121251
111a71750a758
129a886ba2ab
134a774a854c
142683da7843
1514dbb76cbb
hexbe2d30823

51050121251 has 4 divisors (see below), whose sum is σ = 51076977504. Its totient is φ = 51023265000.

The previous prime is 51050121229. The next prime is 51050121281. The reversal of 51050121251 is 15212105015.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-51050121251 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 251050121251 is an apocalyptic number.

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

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

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

The sum of its prime factors is 26856252.

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

Adding to 51050121251 its reverse (15212105015), we get a palindrome (66262226266).

The spelling of 51050121251 in words is "fifty-one billion, fifty million, one hundred twenty-one thousand, two hundred fifty-one".

Divisors: 1 1901 26854351 51050121251