Search a number
-
+
27770682500549 is a prime number
BaseRepresentation
bin1100101000001110111011…
…01010100110010111000101
310122022211222121111221101122
412110013131222212113011
512114443324210004144
6135021401520203325
75564236254323612
oct624073552462705
9118284877457348
1027770682500549
11893753132288a
123146189469545
1312659c1a16b01
146c0172cb1509
153325a4b157ee
hex1941ddaa65c5

27770682500549 has 2 divisors, whose sum is σ = 27770682500550. Its totient is φ = 27770682500548.

The previous prime is 27770682500543. The next prime is 27770682500597. The reversal of 27770682500549 is 94500528607772.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 20255463368449 + 7515219132100 = 4500607^2 + 2741390^2 .

It is a cyclic number.

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

It is a junction number, because it is equal to n+sod(n) for n = 27770682500491 and 27770682500500.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (27770682500543) 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, 13885341250274 + 13885341250275.

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

Almost surely, 227770682500549 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 59270400, while the sum is 62.

The spelling of 27770682500549 in words is "twenty-seven trillion, seven hundred seventy billion, six hundred eighty-two million, five hundred thousand, five hundred forty-nine".