Search a number
-
+
553545505571551 is a prime number
BaseRepresentation
bin111110111011100100101101…
…1001110100000001011011111
32200120221102201000222110002221
41331313021123032200023133
51040023242143411242201
65241143143352130211
7224411225440611343
oct17567113316401337
92616842630873087
10553545505571551
1115041636aaa24a9
12521009b1996967
131a9b416a62b80c
149a99a61615623
1543edec78dc4a1
hex1f7725b3a02df

553545505571551 has 2 divisors, whose sum is σ = 553545505571552. Its totient is φ = 553545505571550.

The previous prime is 553545505571507. The next prime is 553545505571573. The reversal of 553545505571551 is 155175505545355.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 553545505571551 - 211 = 553545505569503 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2553545505571551 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 164062500, while the sum is 61.

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