Search a number
-
+
494683690261 is a prime number
BaseRepresentation
bin1110011001011010111…
…00100001010100010101
31202021212100122012021211
413030231130201110111
531101103011042021
61015130552141421
750511502663135
oct7145534412425
91667770565254
10494683690261
11180881057292
127ba58697871
1337857900877
1419d2b144ac5
15cd0404a3e1
hex732d721515

494683690261 has 2 divisors, whose sum is σ = 494683690262. Its totient is φ = 494683690260.

The previous prime is 494683690199. The next prime is 494683690321. The reversal of 494683690261 is 162096386494.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 437490967761 + 57192722500 = 661431^2 + 239150^2 .

It is a cyclic number.

It is not a de Polignac number, because 494683690261 - 27 = 494683690133 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2494683690261 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13436928, while the sum is 58.

The spelling of 494683690261 in words is "four hundred ninety-four billion, six hundred eighty-three million, six hundred ninety thousand, two hundred sixty-one".