Search a number
-
+
61116555127 is a prime number
BaseRepresentation
bin111000111010110101…
…001001111101110111
312211202022120200102211
4320322311021331313
52000131314231002
644024311514251
74262345101315
oct707265117567
9184668520384
1061116555127
1123a1277a4a1
12ba17988987
1359bcb862b4
142d5aca10b5
1518ca7a8dd7
hexe3ad49f77

61116555127 has 2 divisors, whose sum is σ = 61116555128. Its totient is φ = 61116555126.

The previous prime is 61116555077. The next prime is 61116555217. The reversal of 61116555127 is 72155561116.

Together with next prime (61116555217) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 61116555127 - 235 = 26756816759 is a prime.

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

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (61116535127) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30558277563 + 30558277564.

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

Almost surely, 261116555127 is an apocalyptic number.

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

61116555127 is an equidigital number, since it uses as much as digits as its factorization.

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

The product of its digits is 63000, while the sum is 40.

The spelling of 61116555127 in words is "sixty-one billion, one hundred sixteen million, five hundred fifty-five thousand, one hundred twenty-seven".