Search a number
-
+
4909610574361 is a prime number
BaseRepresentation
bin100011101110001101110…
…0110000010001000011001
3122101100120012110112202001
41013130123212002020121
51120414340301334421
614235235521241001
71014464504214643
oct107343346021031
918340505415661
104909610574361
1116231771a31a9
12673622793161
13297c8869381c
1412d8aac77893
1587a9c0be691
hex4771b982219

4909610574361 has 2 divisors, whose sum is σ = 4909610574362. Its totient is φ = 4909610574360.

The previous prime is 4909610574329. The next prime is 4909610574397. The reversal of 4909610574361 is 1634750169094.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 4549347726400 + 360262847961 = 2132920^2 + 600219^2 .

It is a cyclic number.

It is not a de Polignac number, because 4909610574361 - 25 = 4909610574329 is a prime.

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

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

Almost surely, 24909610574361 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 4909610574361 in words is "four trillion, nine hundred nine billion, six hundred ten million, five hundred seventy-four thousand, three hundred sixty-one".