Search a number
-
+
558473689469 is a prime number
BaseRepresentation
bin10000010000001111010…
…00000011100101111101
31222101111222202220120002
420020013220003211331
533122223231030334
61104320445204045
755230333015203
oct10100750034575
91871458686502
10558473689469
111a59359248a3
129029b860625
1340882603127
141d05d0c5073
15e7d9390b7e
hex8207a0397d

558473689469 has 2 divisors, whose sum is σ = 558473689470. Its totient is φ = 558473689468.

The previous prime is 558473689451. The next prime is 558473689481. The reversal of 558473689469 is 964986374855.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 355171897369 + 203301792100 = 595963^2 + 450890^2 .

It is a cyclic number.

It is not a de Polignac number, because 558473689469 - 220 = 558472640893 is a prime.

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

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

It is a congruent number.

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

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

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

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

Almost surely, 2558473689469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 1567641600, while the sum is 74.

The spelling of 558473689469 in words is "five hundred fifty-eight billion, four hundred seventy-three million, six hundred eighty-nine thousand, four hundred sixty-nine".