Search a number
-
+
51105025151 = 431188488957
BaseRepresentation
bin101111100110000110…
…001100110001111111
311212220121010021011022
4233212012030301333
51314130341301101
635251034014355
73456300355265
oct574606146177
9155817107138
1051105025151
111a7454aa884
129aa2b773bb
134a8598ca6b
14268b3ba435
1514e18bea1b
hexbe618cc7f

51105025151 has 4 divisors (see below), whose sum is σ = 52293514152. Its totient is φ = 49916536152.

The previous prime is 51105025141. The next prime is 51105025157. The reversal of 51105025151 is 15152050115.

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 51105025151 - 210 = 51105024127 is a prime.

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

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 51105025151.

It is a congruent number.

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

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

Almost surely, 251105025151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1188489000.

The product of its (nonzero) digits is 1250, while the sum is 26.

Adding to 51105025151 its reverse (15152050115), we get a palindrome (66257075266).

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

Divisors: 1 43 1188488957 51105025151