Search a number
-
+
51555641 is a prime number
BaseRepresentation
bin1100010010101…
…0110100111001
310121000022001012
43010222310321
5101144240031
65041003305
71164133664
oct304526471
9117008035
1051555641
1127113575
1215323535
13a8b14c7
146bc06db
1547d5b2b
hex312ad39

51555641 has 2 divisors, whose sum is σ = 51555642. Its totient is φ = 51555640.

The previous prime is 51555613. The next prime is 51555643. The reversal of 51555641 is 14655515.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 31125241 + 20430400 = 5579^2 + 4520^2 .

It is a cyclic number.

It is not a de Polignac number, because 51555641 - 210 = 51554617 is a prime.

Together with 51555643, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

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

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

Almost surely, 251555641 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 15000, while the sum is 32.

The square root of 51555641 is about 7180.2256928317. The cubic root of 51555641 is about 372.1848837211.

The spelling of 51555641 in words is "fifty-one million, five hundred fifty-five thousand, six hundred forty-one".