Search a number
-
+
565050199669 is a prime number
BaseRepresentation
bin10000011100011111001…
…11011100111001110101
32000000111022122020112221
420032033213130321311
533224210322342134
61111325214442341
755552320310264
oct10161747347165
92000438566487
10565050199669
111a870011a29a
12916162033b1
134138cc61a97
141d4c46c45db
15ea719065b4
hex838f9dce75

565050199669 has 2 divisors, whose sum is σ = 565050199670. Its totient is φ = 565050199668.

The previous prime is 565050199661. The next prime is 565050199691. The reversal of 565050199669 is 966991050565.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 446841445444 + 118208754225 = 668462^2 + 343815^2 .

It is a cyclic number.

It is not a de Polignac number, because 565050199669 - 23 = 565050199661 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2565050199669 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 565050199669 in words is "five hundred sixty-five billion, fifty million, one hundred ninety-nine thousand, six hundred sixty-nine".