Search a number
-
+
55571543346751 is a prime number
BaseRepresentation
bin11001010001010110000100…
…00110011100111000111111
321021202120212101220200101221
430220223002012130320333
524240441010044044001
6314105114203214211
714463624435444535
oct1450530206347077
9237676771820357
1055571543346751
11167858395213a3
126296179517367
1325014b2a3a883
14da1969b74155
15665823d331a1
hex328ac219ce3f

55571543346751 has 2 divisors, whose sum is σ = 55571543346752. Its totient is φ = 55571543346750.

The previous prime is 55571543346667. The next prime is 55571543346931. The reversal of 55571543346751 is 15764334517555.

55571543346751 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 55571543346751 - 241 = 53372520091199 is a prime.

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

It is a congruent number.

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

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

Almost surely, 255571543346751 is an apocalyptic number.

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

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

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

The product of its digits is 132300000, while the sum is 61.

The spelling of 55571543346751 in words is "fifty-five trillion, five hundred seventy-one billion, five hundred forty-three million, three hundred forty-six thousand, seven hundred fifty-one".