Search a number
-
+
265201666655551 is a prime number
BaseRepresentation
bin111100010011001100010011…
…001000101000010100111111
31021210000000212010112021001121
4330103030103020220110333
5234230031003130434201
62340011544100451411
7106601121345436453
oct7423142310502477
91253000763467047
10265201666655551
117755743904109a
12258b1a396a9b67
13b4c95435c39c2
14496bb872aa663
15209d785ca19a1
hexf1331322853f

265201666655551 has 2 divisors, whose sum is σ = 265201666655552. Its totient is φ = 265201666655550.

The previous prime is 265201666655483. The next prime is 265201666655579. The reversal of 265201666655551 is 155556666102562.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 265201666655551 - 229 = 265201129784639 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 265201666655551.

It is a congruent number.

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

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

Almost surely, 2265201666655551 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 97200000, while the sum is 61.

The spelling of 265201666655551 in words is "two hundred sixty-five trillion, two hundred one billion, six hundred sixty-six million, six hundred fifty-five thousand, five hundred fifty-one".