Search a number
-
+
56519151701 is a prime number
BaseRepresentation
bin110100101000110011…
…011101000001010101
312101212220202101112212
4310220303131001111
51411222400323301
641544201323205
74040411601635
oct645063350125
9171786671485
1056519151701
1121a73651231
12ab54196505
135439567b3c
142a4247c6c5
15170bd7a4bb
hexd28cdd055

56519151701 has 2 divisors, whose sum is σ = 56519151702. Its totient is φ = 56519151700.

The previous prime is 56519151679. The next prime is 56519151709. The reversal of 56519151701 is 10715191565.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 56382027601 + 137124100 = 237449^2 + 11710^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

Almost surely, 256519151701 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 47250, while the sum is 41.

The spelling of 56519151701 in words is "fifty-six billion, five hundred nineteen million, one hundred fifty-one thousand, seven hundred one".