Search a number
-
+
4851137988509 is a prime number
BaseRepresentation
bin100011010010111111001…
…0110110100011110011101
3122011202122010222102022012
41012211332112310132131
51113440112311113014
614152325415001005
71010324502353501
oct106457626643635
918152563872265
104851137988509
1116003a0a1aa8a
12664224369165
132925ca5068b7
1412ab211c2301
15862c89cdc3e
hex4697e5b479d

4851137988509 has 2 divisors, whose sum is σ = 4851137988510. Its totient is φ = 4851137988508.

The previous prime is 4851137988469. The next prime is 4851137988527. The reversal of 4851137988509 is 9058897311584.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 2459157148900 + 2391980839609 = 1568170^2 + 1546603^2 .

It is a cyclic number.

It is not a de Polignac number, because 4851137988509 - 216 = 4851137922973 is a prime.

It is a super-3 number, since 3×48511379885093 (a number of 39 digits) contains 333 as substring.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 24851137988509 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 87091200, while the sum is 68.

The spelling of 4851137988509 in words is "four trillion, eight hundred fifty-one billion, one hundred thirty-seven million, nine hundred eighty-eight thousand, five hundred nine".