Search a number
-
+
201745585693 is a prime number
BaseRepresentation
bin1011101111100011111…
…0010101011000011101
3201021201222220121220101
42323320332111120131
511301133332220233
6232403004021101
720401305120061
oct2737076253035
9637658817811
10201745585693
117861813a603
1233124231791
1316041b69812
149a9bc71aa1
1553ab82ec7d
hex2ef8f9561d

201745585693 has 2 divisors, whose sum is σ = 201745585694. Its totient is φ = 201745585692.

The previous prime is 201745585621. The next prime is 201745585711. The reversal of 201745585693 is 396585547102.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 112049528644 + 89696057049 = 334738^2 + 299493^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×2017455856932 (a number of 23 digits) contains 22 as substring.

It is a congruent number.

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

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

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

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

It is a 1-persistent number, because it is pandigital, but 2⋅201745585693 = 403491171386 is not.

Almost surely, 2201745585693 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9072000, while the sum is 55.

The spelling of 201745585693 in words is "two hundred one billion, seven hundred forty-five million, five hundred eighty-five thousand, six hundred ninety-three".