Search a number
-
+
200646541064549 is a prime number
BaseRepresentation
bin101101100111110010101001…
…110011100011100101100101
3222022102121210102201011021002
4231213302221303203211211
5202244343104003031144
61550423425400203045
760156143222556416
oct5547625163434545
9868377712634232
10200646541064549
1158a287a164a558
121a606788769485
1387c5b70199a28
1437794b708980d
15182e424ca714e
hexb67ca9ce3965

200646541064549 has 2 divisors, whose sum is σ = 200646541064550. Its totient is φ = 200646541064548.

The previous prime is 200646541064513. The next prime is 200646541064561. The reversal of 200646541064549 is 945460145646002.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 151552275771649 + 49094265292900 = 12310657^2 + 7006730^2 .

It is a cyclic number.

It is not a de Polignac number, because 200646541064549 - 28 = 200646541064293 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

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

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

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

Almost surely, 2200646541064549 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 24883200, while the sum is 56.

The spelling of 200646541064549 in words is "two hundred trillion, six hundred forty-six billion, five hundred forty-one million, sixty-four thousand, five hundred forty-nine".