Search a number
-
+
65111311311157 = 11311231318338921
BaseRepresentation
bin11101100110111111010001…
…00101001110000100110101
322112112120200020101010111101
432303133220211032010311
532013240431143424112
6350251420134410101
716500064664301616
oct1663375045160465
9275476606333441
1065111311311157
1119823608872201
127377012500931
132a43c7ca07bc7
1412115934c9c0d
1577da64593757
hex3b37e894e135

65111311311157 has 16 divisors (see below), whose sum is σ = 65752687024128. Its totient is φ = 64471090844160.

The previous prime is 65111311311119. The next prime is 65111311311161. The reversal of 65111311311157 is 75111311311156.

It is a cyclic number.

It is not a de Polignac number, because 65111311311157 - 27 = 65111311311029 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (65111311311107) by changing a digit.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1672890057 + ... + 1672928977.

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

Almost surely, 265111311311157 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 53340.

The product of its digits is 9450, while the sum is 37.

Subtracting 65111311311157 from its reverse (75111311311156), we obtain a palindrome (9999999999999).

The spelling of 65111311311157 in words is "sixty-five trillion, one hundred eleven billion, three hundred eleven million, three hundred eleven thousand, one hundred fifty-seven".

Divisors: 1 113 1123 13183 38921 126899 1489679 4398073 14804509 43708283 513095543 1672909517 4939035979 57979796359 576206294789 65111311311157