Search a number
-
+
561515911047257 is a prime number
BaseRepresentation
bin111111110101100100001110…
…0011010011110100001011001
32201122011101201022001020200212
41333223020130122132201121
51042044334041212003012
65310124503130540505
7226163120506410635
oct17753103432364131
92648141638036625
10561515911047257
11152a096191075a1
1252b89666597735
131b141952b6862a
149c9372d637dc5
1544db4b661eb22
hex1feb21c69e859

561515911047257 has 2 divisors, whose sum is σ = 561515911047258. Its totient is φ = 561515911047256.

The previous prime is 561515911047209. The next prime is 561515911047269. The reversal of 561515911047257 is 752740119515165.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 514784413477321 + 46731497569936 = 22688861^2 + 6836044^2 .

It is a cyclic number.

It is not a de Polignac number, because 561515911047257 - 226 = 561515843938393 is a prime.

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

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

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

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

Almost surely, 2561515911047257 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13230000, while the sum is 59.

The spelling of 561515911047257 in words is "five hundred sixty-one trillion, five hundred fifteen billion, nine hundred eleven million, forty-seven thousand, two hundred fifty-seven".