Search a number
-
+
609154549093 is a prime number
BaseRepresentation
bin10001101110101000111…
…00001100010101100101
32011020100000202100000001
420313110130030111211
534440022031032333
61143501452021301
762003263143346
oct10672434142545
92136300670001
10609154549093
11215382953852
129a084761831
134559b44016c
14216aa00a0cd
1510ca38c6b7d
hex8dd470c565

609154549093 has 2 divisors, whose sum is σ = 609154549094. Its totient is φ = 609154549092.

The previous prime is 609154549067. The next prime is 609154549121. The reversal of 609154549093 is 390945451906.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 526752253729 + 82402295364 = 725777^2 + 287058^2 .

It is a cyclic number.

It is not a de Polignac number, because 609154549093 - 217 = 609154418021 is a prime.

It is a super-2 number, since 2×6091545490932 (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 (609154549063) by changing a digit.

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

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

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

Almost surely, 2609154549093 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 609154549093 in words is "six hundred nine billion, one hundred fifty-four million, five hundred forty-nine thousand, ninety-three".