Search a number
-
+
55943727869 is a prime number
BaseRepresentation
bin110100000110100000…
…011000101011111101
312100101210222211110002
4310012200120223331
51404033043242434
641411124124045
74020223561301
oct640640305375
9170353884402
1055943727869
11217a8859847
12aa13536625
135377295573
1429c9c91d01
1516c65b457e
hexd06818afd

55943727869 has 2 divisors, whose sum is σ = 55943727870. Its totient is φ = 55943727868.

The previous prime is 55943727841. The next prime is 55943727893. The reversal of 55943727869 is 96872734955.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 54878684644 + 1065043225 = 234262^2 + 32635^2 .

It is a cyclic number.

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

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

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

Almost surely, 255943727869 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 114307200, while the sum is 65.

The spelling of 55943727869 in words is "fifty-five billion, nine hundred forty-three million, seven hundred twenty-seven thousand, eight hundred sixty-nine".