Search a number
-
+
551701961 is a prime number
BaseRepresentation
bin100000111000100…
…100110111001001
31102110010100210222
4200320210313021
52112213430321
6130424515425
716446250346
oct4070446711
91373110728
10551701961
1126346a938
1213491bb75
138a3b8085
14533b37cd
153367c3ab
hex20e24dc9

551701961 has 2 divisors, whose sum is σ = 551701962. Its totient is φ = 551701960.

The previous prime is 551701949. The next prime is 551701967. The reversal of 551701961 is 169107155.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 401761936 + 149940025 = 20044^2 + 12245^2 .

It is a cyclic number.

It is not a de Polignac number, because 551701961 - 210 = 551700937 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 2551701961 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9450, while the sum is 35.

The square root of 551701961 is about 23488.3367014355. The cubic root of 551701961 is about 820.1655232979.

The spelling of 551701961 in words is "five hundred fifty-one million, seven hundred one thousand, nine hundred sixty-one".